2430 search results - page 257 / 486 » Computing Tutte Polynomials |
148
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
129
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
124
click to vote
SAC
1997
ACM
15 years 8 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
148
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
126
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...