Property testing with online adversaries
From MaRDI portal
Cites work
- L_p-testing
- A new upper bound on the query complexity of testing generalized Reed-Muller codes
- A PCP characterization of NP with optimal amortized query complexity
- Adaptive lower bound for testing monotonicity on the line
- Algebraic property testing: the role of invariance
- Analysis of Boolean Functions
- Approximating the distance to monotonicity of Boolean functions
- Breaking the -soundness bound of the linearity test over GF(2)
- Brief announcement: Erasure-resilience versus tolerance to errors
- Combinatorial Games
- Derandomizing Homomorphism Testing in General Groups
- Efficient probabilistically checkable proofs and applications to approximations
- Encyclopedia of algorithms. In 3 volumes
- Erasure-Resilient Property Testing
- Erasures versus errors in local decoding and property testing
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Gowers Uniformity, Influence of Variables, and PCPs
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1775415 (Why is no real title available?)
- scientific article; zbMATH DE number 1418269 (Why is no real title available?)
- scientific article; zbMATH DE number 6395191 (Why is no real title available?)
- scientific article; zbMATH DE number 7650357 (Why is no real title available?)
- Improved low-degree testing and its applications
- Improved non-approximability results
- Improved optimal testing results from global hypercontractivity
- Interactive proofs and the hardness of approximating cliques
- Linearity testing in characteristic two
- Low-degree test with polynomially small error
- Low-degree tests at large distances
- Non-deterministic exponential time has two-prover interactive protocols
- On learning and testing dynamic environments
- Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
- Optimal testing of multivariate polynomials over small prime fields
- Optimal testing of Reed-Muller codes
- Parameterized property testing of functions
- PCPs via low-degree long code and hardness for constrained hypergraph coloring
- Positional games
- Probabilistically checkable proofs with low amortized query complexity
- Property Testing on Product Distributions
- Random low-degree polynomials are hard to approximate
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- Simple analysis of graph tests for linearity and PCP
- Spot-checkers
- Sub-Constant Error Low Degree Test of Almost-Linear Size
- Sublinear-time computation in the presence of online erasures
- Testing and reconstruction of Lipschitz functions with applications to data privacy
- Testing Lipschitz functions on hypergrid domains
- Testing local properties of arrays
- Testing low-degree polynomials over prime fields
- Testing Polynomials over General Fields
- Testing Reed–Muller Codes
- Testing the Lipschitz property over product distributions with applications to data privacy
- Transitive-closure spanners
This page was built for publication: Property testing with online adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906429)
