Sciweavers

71 search results - page 4 / 15
» Testing Boolean Function Isomorphism
Sort
View
RANDOM
2001
Springer
15 years 2 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
ASPDAC
1999
ACM
101views Hardware» more  ASPDAC 1999»
15 years 2 months ago
Fast Boolean Matching Under Permutation Using Representative
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
Debatosh Debnath, Tsutomu Sasao
EUROGP
2001
Springer
15 years 2 months ago
Neutrality and the Evolvability of Boolean Function Landscape
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding sche...
Tina Yu, Julian F. Miller
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
15 years 3 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
15 years 3 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...