352 search results - page 14 / 71 » Proofs as Polynomials |
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
APAL
2008
13 years 6 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
CRYPTO
2005
Springer
14 years 8 days ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...