13603 search results - page 249 / 2721 » On the Computational Complexity of Cut-Reduction |
159
Voted
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
143
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
162
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...