Pages that link to "Item:Q4369864"
From MaRDI portal
The following pages link to Designing programs that check their work (Q4369864):
Displaying 50 items.
- Checker for data structures which sort elements (Q293137) (← links)
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- Certifying algorithms (Q465678) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Test suite oscillations (Q844155) (← links)
- Checking the correctness of memories (Q890427) (← links)
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Batch checking with applications to linear functions (Q1198028) (← links)
- A formal framework for evaluating heuristic programs (Q1267764) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Checking geometric programs or verification of geometric structures (Q1286479) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- Tight bounds on expected time to add correctly and add mostly correctly (Q1318774) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spot-checkers (Q1577018) (← links)
- Problem identification using program checking (Q1765236) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Testing nonlinear operators (Q1895875) (← links)
- Efficient checkers for number-theoretic computations (Q1898116) (← links)
- Low redundancy polynomial checks for numerical computation (Q1925011) (← links)
- Program verification: to err is human (Q2026776) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- A self-certifying compilation framework for WebAssembly (Q2234063) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- A framework for the verification of certifying computations (Q2351144) (← links)
- Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces (Q2413447) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
