Tag:Np-hard
From Wikipedia, the free encyclopedia
Jump to:
navigation
,
search
Related Tags
algorithms
complexity
programming
np-complete
analysis
research
algorithm
cs
npcomplete
karp
problem
np
mathematics
study
microsoft
diplomarbeit
csci3434
computing
winter2008
theory
man
#tag-refactored
computerscience
computational_complexity_theory
nondeterministic%2Bpolynomial%2Btime
salesman
np+hard
np_hard
phd
sales
procitaj
computable
computer_science
bio
bsa
simulatedannealing
mathandalgo
Articles
NP-hard (3)
algorithms
programming
analysis
wikipedia
research
algorithm
np-hard
reference
study
mathematics
phd
np_hard
np+hard
np
problem
nondeterministic%2Bpolynomial%2Btime
salesman
sales
procitaj
simulatedannealing
computational_complexity_theory
complexity
bsa
bio
computable
computer_science
mathandalgo
man
diplomarbeit
microsoft
Karp's 21 NP-complete problems (1)
complexity
np-complete
karp
npcomplete
cs
algorithms
problem
theory
wikipedia
np-hard
winter2008
computerscience
#tag-refactored
computing
csci3434
np
Views
Article
Discussion
Edit this page
History
Tags
Personal tools
Log in / create account
Navigation
Main page
Contents
Featured content
Current events
Random article
Search
Interaction
About Wikipedia
Community portal
Recent changes
Contact Wikipedia
Donate to Wikipedia
Help
Toolbox
What links here
Related changes
Upload file
Special pages
Printable version
Permanent link
Cite this page