111 search results - page 2 / 23 » Third-Order Computation and Bounded Arithmetic |
CADE
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
CIE
2007
Springer
13 years 4 months ago
2007
Springer
DAGSTUHL
2008
13 years 6 months ago
2008
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...