Tag:Algorithm.npcomplete
From Wikipedia, the free encyclopedia
Jump to:
navigation
,
search
Related Tags
logic
programming
sat
math
algorithm
complexity
satisfiability
algorithms
constraints
theory
np
cs
phd
np-complete
bool
3-sat
boolean
boolean_satisfiability
complejidad
clauses
constraint
decision
computable
definition
fpors
complete
discretemath
cnf
Articles
Boolean satisfiability problem (1)
programming
logic
sat
math
satisfiability
complexity
algorithm
algorithms
theory
constraints
phd
np-complete
wiki
cs
np
constraint
computable
decision
definition
fpors
discretemath
complete
cnf
algorithm.npcomplete
3-sat
bool
boolean
clauses
boolean_satisfiability
complejidad
Views
Article
Discussion
Edit this page
History
Tags
Personal tools
NOTE: This is just a
prototype of tag-based navigation
on Wikipedia. Visit
Wikipedia
for the online encyclopedia.
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