The following pages link to (Q3210157):
Displaying 40 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Checking the correctness of memories (Q890427) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- On games of incomplete information (Q1199525) (← links)
- Highly resilient correctors for polynomials (Q1199875) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spot-checkers (Q1577018) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average (Q2240857) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- Checking properties of polynomials (Q4571953) (← links)
- Program result checking: A new approach to making programs more reliable (Q4630244) (← links)
- Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q4993289) (← links)
- (Q5002697) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
