188 search results - page 28 / 38 » Logic of Proofs for Bounded Arithmetic |
101
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
111
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
106
click to vote
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
IJSYSC
2006
14 years 11 months ago
2006
: A backlash compensator is designed for nonlinear systems using the fuzzy logic. The classification property of fuzzy logic systems makes them a natural candidate for the rejectio...