1401 search results - page 72 / 281 » Randomness in Interactive Proofs |
165
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](http://sciweaver.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
119
click to vote
CAS
1999
15 years 6 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
187
click to vote
MST
2010
15 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
157
click to vote
CEC
2005
IEEE
16 years 7 days ago
2005
IEEE
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
154
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...