Sciweavers

1795 search results - page 47 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ACSD
2010
IEEE
224views Hardware» more  ACSD 2010»
13 years 6 months ago
Robustness of Sequential Circuits
Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environm...
Laurent Doyen, Thomas A. Henzinger, Axel Legay, De...
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
14 years 3 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
Frédéric Bihan, J. Maurice Rojas, Ca...
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 5 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
EH
2000
IEEE
92views Hardware» more  EH 2000»
14 years 1 months ago
Evolving Hardware on a Large Scale
This paper presents a detailed technical description of a large-scale evolvable hardware system for evolving complex digital circuits directly in silicon at high speed. The core o...
Michael Korkin, Gary Fehr, Gregory Jeffery
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
14 years 19 days ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola