77 search results - page 6 / 16 » Boolean Circuits and a DNA Algorithm in Membrane Computing |
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
BMCBI
2002
13 years 7 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...