Sciweavers

707 search results - page 123 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
RELMICS
2000
Springer
13 years 11 months ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
STACS
2000
Springer
13 years 11 months ago
Average-Case Quantum Query Complexity
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
Andris Ambainis, Ronald de Wolf
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
13 years 11 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz
ICCAD
1994
IEEE
119views Hardware» more  ICCAD 1994»
13 years 11 months ago
Multi-level network optimization for low power
This paper describes a procedure for minimizing the power consumption in a boolean network under the zero delay model. Power is minimized by modifying the function of each interme...
Sasan Iman, Massoud Pedram
AAAI
2008
13 years 10 months ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche