983 search results - page 8 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
DFG
1992
Springer
13 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
DAGSTUHL
2006
13 years 9 months ago
2006
COCO
1989
Springer
13 years 11 months ago
1989
Springer
INFORMS
2002
13 years 7 months ago
2002
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...