19 search results - page 3 / 4 » The Size and Depth of Layered Boolean Circuits |
DAC
1996
ACM
13 years 10 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 ...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
CSR
2010
Springer
13 years 10 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
SPAA
2005
ACM
13 years 11 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 ...
TCS
1998
13 years 5 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...