Tag:Np-complete
From Wikipedia, the free encyclopedia
Jump to: navigation, search
Related Tags
algorithms complexity algorithm math programming mathematics np research theory logic computerscience sat optimization science cs satisfiability compsci computation software computer algorithm.complexity education search constraints analysis cryptography puzzle geek howto complete complejidad complexitytheory differencemap phd constraint tcs computer.science computer-science npcomplete classic computable karp information thesis read boolean logistics problemsize clauses boolean_satisfiability turing logn computationalcomplexitytheory maths modelling characterization yeah! strange.attractor optimisation bool difference_map_algorithm interesting datamining csp set from:reddit weblog class complexidade fuck dissertation3rdyear computation-complexity-theory computational-complexity complexity-class subsets problem - _check np-hard winter2008 computing #tag-refactored approximation alg automata computability algorytmy .mylinks al .toread/work csci3434 statistics definition decision fpors discretemath algorithm.npcomplete cnf old_blogroll npc
Articles
- List of NP-complete problems (20)
- NP-complete (15)
- Karp's 21 NP-complete problems (4)
- Subset sum problem (3)
- Boolean satisfiability problem (2)
- Complexity class (2)complexity algorithms np-complete wiki algorithm mathematics maths math logn modelling programming turing wikipedia read logistics problemsize optimization computationalcomplexitytheory complexity-class compsci complexidade class characterization computable computation computerscience computer-science computational-complexity computation-complexity-theory cs
- Difference map algorithm (1)
Retrieved from "http://en.wikipedia.org/wiki/Tag:Np-complete"
