scientific article; zbMATH DE number 4191094
From MaRDI portal
Publication:3210157
zbMATH Open0722.68028MaRDI QIDQ3210157FDOQ3210157
Publication date: 1991
Title of this publication is not available (Why is that?)
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)
Cited In (47)
- Title not available (Why is that?)
- Pipelined algorithms to detect cheating in long-term grid computations
- On the Symmetries of and Equivalence Test for Design Polynomials.
- Approximate testing with error relative to input size.
- A new approach in feature interaction testing
- Title not available (Why is that?)
- 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
- March Test Generation Revealed
- Highly resilient correctors for polynomials
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
- On black-box verifiable outsourcing
- Checking the correctness of memories
- Fast approximate probabilistically checkable proofs
- Self-correcting for function fields of finite transcendental degree
- Constructing concrete hard instances of the maximum independent set problem
- Erasures versus errors in local decoding and property testing
- Self-testing/correcting with applications to numerical problems
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Title not available (Why is that?)
- Program result checking: A new approach to making programs more reliable
- Spot-checkers
- Locally random reductions: Improvements and applications
- A note on the self-witnessing property of computational problems
- Locality and checkability in wait-free computing
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
- Pseudorandom generators without the XOR lemma
- An information-theoretic treatment of random-self-reducibility
- On the autoreducibility of functions
- Decoding of Reed Solomon codes beyond the error-correction bound
- Locality and Checkability in Wait-Free Computing
- 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
- Can we locally compute sparse connected subgraphs?
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Probabilistically checkable proofs and their consequences for approximation algorithms
- Checking properties of polynomials
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Title not available (Why is that?)
- Efficient learning algorithms yield circuit lower bounds
- On derandomizing Yao's weak-to-strong OWF construction
- On games of incomplete information
- Foundations of Homomorphic Secret Sharing
- 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)
