989 search results - page 67 / 198 » Pebbling and Proofs of Work |
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
CASC
2009
Springer
14 years 2 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
ISMVL
2007
IEEE
14 years 2 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
AMS
2005
Springer
14 years 1 months ago
2005
Springer
Visual Odometry is the process of estimating the movement of a (stereo) camera through its environment by matching point features between pairs of consecutive image frames. No prio...