Sciweavers

245 search results - page 4 / 49
» On the Average-Case Complexity of Property Testing
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
15 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
ECCC
2007
69views more  ECCC 2007»
14 years 9 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
ICDCS
2007
IEEE
15 years 3 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee
ECCC
2007
124views more  ECCC 2007»
14 years 9 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 1 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira