scientific article; zbMATH DE number 4191094
From MaRDI portal
Publication:3210157
Recommendations
Cited in
(49)- Pipelined algorithms to detect cheating in long-term grid computations
- Approximate testing with error relative to input size.
- Local decoding and testing of polynomials over grids
- On the Symmetries of and Equivalence Test for Design Polynomials.
- scientific article; zbMATH DE number 4023204 (Why is no real title available?)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
- Worst-Case to Average-Case Reductions for Subclasses of P
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Highly resilient correctors for polynomials
- March Test Generation Revealed
- Checking the correctness of memories
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
- On black-box verifiable outsourcing
- Fast approximate probabilistically checkable proofs
- Self-correcting for function fields of finite transcendental degree
- Constructing concrete hard instances of the maximum independent set problem
- Self-testing/correcting with applications to numerical problems
- Erasures versus errors in local decoding and property testing
- Foundations of homomorphic secret sharing
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Spot-checkers
- Locally random reductions: Improvements and applications
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
- Asymptotic spectra: theory, applications, and extensions
- Locality and checkability in wait-free computing
- A note on the self-witnessing property of computational problems
- Locality and checkability in wait-free computing
- Pseudorandom generators without the XOR lemma
- On the autoreducibility of functions
- Decoding of Reed Solomon codes beyond the error-correction bound
- Locally computing edge orientations
- Randomness vs time: Derandomization under a uniform assumption
- Linear-size constant-query IOPs for delegating computation
- Circuit lower bounds from learning-theoretic approaches
- PSPACE is provable by two provers in one round
- Normalised squeeziness and failed error propagation
- Can we locally compute sparse connected subgraphs?
- Probabilistically checkable proofs and their consequences for approximation algorithms
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Fine-grained derandomization: from problem-centric to resource-centric complexity
- Checking properties of polynomials
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Efficient learning algorithms yield circuit lower bounds
- scientific article; zbMATH DE number 3994772 (Why is no real title available?)
- Program result checking: a new approach to making programs more reliable
- On games of incomplete information
- On derandomizing Yao's weak-to-strong OWF construction
- An information-theoretic treatment of random-self-reducibility (extended abstract)
- New statistics for demand-based software testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210157)
