983 search results - page 33 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
DAC
1998
ACM
13 years 12 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
MEMOCODE
2007
IEEE
14 years 2 months ago
2007
IEEE
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...