2 search results - page 1 / 1 » Towards a Solution to the "Runs" Conjecture |
CPM
2008
Springer
13 years 6 months ago
2008
Springer
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...