Pages that link to "Item:Q5900945"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900945):
Displaying 10 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- A sublinear bipartiteness tester for bounded degree graphs (Q1964592) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects (Q3603487) (← links)
- (Q4542547) (← links)
- A Brief Introduction to Property Testing (Q4933359) (← links)
- Testing bipartiteness of geometric intersection graphs (Q4962781) (← links)
- (Q5090430) (← links)
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (Q5237911) (← links)
- Restricted Bipartite Graphs: Comparison and Hardness Results (Q5251649) (← links)