11 search results - page 1 / 3 » An Independence Result for Intuitionistic Bounded Arithmetic |
LOGCOM
2006
13 years 10 months ago
2006
APAL
2005
13 years 10 months ago
2005
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...
PDPTA
2003
14 years 6 days ago
2003
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
CVPR
2001
IEEE
15 years 26 days ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
STOC
1989
ACM
14 years 2 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...