155 search results - page 2 / 31 » Bounded Arithmetic and Descriptive Complexity |
DAC
2005
ACM
13 years 7 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ASPDAC
2008
ACM
13 years 7 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
LOGCOM
2010
13 years 3 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...