13306 search results - page 425 / 2662 » Theoretical Computer Science |
171
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
181
click to vote
STACS
1993
Springer
15 years 11 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
161
click to vote
FOCS
1989
IEEE
15 years 11 months ago
1989
IEEE
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...
140
click to vote
WG
1992
Springer
15 years 11 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
189
click to vote
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...