1410 search results - page 116 / 282 » Proving theorems by reuse |
164
click to vote
COMBINATORICS
2004
15 years 5 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
173
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
166
click to vote
AI
2000
Springer
15 years 5 months ago
2000
Springer
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
162
click to vote
JSC
2010
15 years 4 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
140
click to vote
CDC
2010
IEEE
15 years 27 days ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...