1199 search results - page 160 / 240 » Parameterized Proof Complexity |
CADE
2008
Springer
14 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
ICCV
2007
IEEE
14 years 3 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...
LPAR
2007
Springer
14 years 3 months ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...