Sciweavers

1795 search results - page 105 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
14 years 29 days ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
COLT
2006
Springer
14 years 17 days ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
TVLSI
2008
110views more  TVLSI 2008»
13 years 8 months ago
Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
Sanjukta Bhanja, Sudeep Sarkar
ISPD
2005
ACM
151views Hardware» more  ISPD 2005»
14 years 2 months ago
Multilevel generalized force-directed method for circuit placement
Automatic circuit placement has received renewed interest recently given the rapid increase of circuit complexity, increase of interconnect delay, and potential sub-optimality of ...
Tony F. Chan, Jason Cong, Kenton Sze
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai