129 search results - page 25 / 26 » Lower Bounds for Testing Triangle-freeness in Boolean Functi... |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
COMBINATORICS
2004
13 years 7 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
SOCO
2010
Springer
13 years 2 months ago
2010
Springer
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...