71 search results - page 2 / 15 » Testing Boolean Function Isomorphism |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
RELMICS
2000
Springer
13 years 9 months ago
2000
Springer
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, ...
PROPERTYTESTING
2010
13 years 3 months ago
2010
We give a high-level survey of the "testing by implicit learning" paradigm, and explain some of the property testing results for various Boolean function classes that ha...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
GD
1999
Springer
13 years 9 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...