Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Neural networks and efficient associative memory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Testing problems with sub-learning sample complexity
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Approximate testing with relative error
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Approximate testing with error relative to input size
Journal of Computer and System Sciences
Efficient Testing of Large Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
Robust methods for databases and robotics
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Robust methods for databases and robotics
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Testing permutation properties through subpermutations
Theoretical Computer Science
Generating all subsets of a finite set with disjoint unions
Journal of Combinatorial Theory Series A
Improved algorithms for quantum identification of boolean oracles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Min sum clustering with penalties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
The authors study the question of determining whether an unknown function has a particular property or is /spl epsiv/-far from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the function on instances of its choice. First, they establish some connections between property testing and problems in learning theory. Next, they focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being k-colorable or having a /spl rho/-clique (clique of density /spl rho/ w.r.t. the vertex set). The graph property testing algorithms are probabilistic and make assertions which are correct with high probability utilizing only poly(1//spl epsiv/) edge-queries into the graph, where /spl epsiv/ is the distance parameter. Moreover, the property testing algorithms can be used to efficiently (i.e., in time linear in the number of vertices) construct partitions of the graph which correspond to the property being tested, if it holds for the input graph.