1302 search results - page 64 / 261 » Free-Style Theorem Proving |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
TPHOL
1997
IEEE
13 years 12 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
COMBINATORICS
2006
13 years 7 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...