5138 search results - page 3 / 1028 » Randomized Algorithms for 3-SAT |
IJCAI
2001
13 years 8 months ago
2001
Of late, new insight into the study of random -SAT
AAAI
2004
13 years 8 months ago
2004
STACS
2005
Springer
14 years 25 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
KI
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
ALGORITHMICA
2007
13 years 7 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...