Sciweavers

1795 search results - page 31 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
IRI
2007
IEEE
14 years 2 months ago
Reuse Technique in Hardware Design
The paper presents a technique for the design of digital systems on the basis of reusable hardware templates, which are circuits with modifiable functionality that might be custom...
Valery Sklyarov, Iouliia Skliarova
DSD
2007
IEEE
117views Hardware» more  DSD 2007»
14 years 17 days ago
On Complexity of Internal and External Equivalence Checking
We compare the complexity of "internal" and "external" equivalence checking. The former is meant for proving the correctness of a synthesis transformation by w...
Eugene Goldberg, Kanupriya Gulati
FPL
2006
Springer
96views Hardware» more  FPL 2006»
14 years 9 days ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
JC
2008
87views more  JC 2008»
13 years 8 months ago
The randomized complexity of initial value problems
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
Stefan Heinrich, Bernhard Milla