92 search results - page 2 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
TCS
1998
13 years 4 months ago
1998
STACS
1987
Springer
13 years 7 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...
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...