Sciweavers

707 search results - page 64 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
13 years 12 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
CEC
2008
IEEE
14 years 2 months ago
Multi-level neutrality in optimization
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...
Colin G. Johnson
ISVLSI
2007
IEEE
107views VLSI» more  ISVLSI 2007»
14 years 2 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
TBILLC
2005
Springer
14 years 1 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
Jan van Eijck
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
14 years 13 days ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin