92 search results - page 6 / 19 » Deterministic Restrictions in Circuit Complexity |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a novel evolvable hardware framework for the automated design of digital circuits for high performance applications. The technique evolves circuits correspondi...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
PODS
2010
ACM
14 years 13 days ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
VLSID
1997
IEEE
13 years 11 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
CSR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...