STACS
1987
Springer
13 years 8 months ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...