The following pages link to (Q4788610):
Displaying 31 items.
- Property testing for cyclic groups and beyond (Q386421) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Is submodularity testable? (Q472463) (← links)
- Testing periodicity (Q534782) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Quantum property testing of group solvability (Q627520) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Testing the expansion of a graph (Q963057) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Testing metric properties (Q1877548) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Testing consistency of quartet topologies: a parameterized approach (Q2445322) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)
- Estimating the distance to a monotone function (Q5433267) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
