182 search results - page 14 / 37 » The Proof Complexity of Polynomial Identities |
ICCV
2007
IEEE
15 years 6 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...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
101
click to vote
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
106
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...