123 search results - page 11 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
DAC
2006
ACM
14 years 8 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
STOC
1989
ACM
13 years 11 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...
IFIP
2001
Springer
13 years 11 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...