TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS
From MaRDI portal
Publication:4923287
DOI10.1142/S0129054112500219zbMath1267.68315OpenAlexW2056208224MaRDI QIDQ4923287
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112500219
Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)
Cites Work
- Testing convexity properties of tree colorings
- Property testing. Current research and surveys
- Information theory in property testing and monotonicity testing in higher dimension
- Self-testing/correcting with applications to numerical problems
- Proof verification and the hardness of approximation problems
- Property testing and its connection to learning and approximation
- Robust Characterizations of Polynomials with Applications to Program Testing
- Property Testing of Massively Parametrized Problems – A Survey
- lgorithmic and Analysis Techniques in Property Testing
- Sound 3-Query PCPPs Are Long
- Property testing in bounded degree graphs