Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
SIAM Journal on Computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Coloring Bipartite Hypergraphs
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Deterministic Hypergraph Coloring and Its Applications
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
Improved Bounds and Algorithms for Hypergraph Two-Coloring
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Testing of function that have small width branching programs
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hardness of approximate hypergraph coloring
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximate checking of polynomials and functional equations
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the robustness of functional equations
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A lower bound for distribution-free monotonicity testing
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
| Hi-index | 0.00 |
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is "far away" from the property. We prove that the fundamental problem of l-colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph. We present a testing algorithm that examines only (k l/Ɛ)(ċk) entries of the adjacency matrix of the input hypergraph, where Ɛ is a distance parameter independent of the size of the hypergraph. Notice that this algorithm tests only a constant number of entries in the adjacency matrix provided that l, k, and Ɛ are constant.