Non-interactive proofs of proximity (Q1745962): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113906244 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2473767456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming graph computations with a helpful advisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Juntas: A Brief Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing lower bounds via communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for sampling algorithms for estimating the average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotations for Sparse Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotations in Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical verified computation with streaming interactive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cycles and trees in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Verification in Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximate probabilistically checkable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial tests, universal tests and decomposability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the query complexity of testing orientations for being Eulerian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly resilient correctors for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic vs non-deterministic graph property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing. Current research and surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Locally Testable Codes and Proofs: A Survey in Two Parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Testing Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiple Input Problems in Property Testing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4578332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of interactive proofs with bounded communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse pseudorandom distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear bipartiteness tester for bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Proximity-Oblivious Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sample-Based Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proximity oblivious testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the randomness complexity of property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Sided Error Proximity Oblivious Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable codes and PCPs of almost-linear length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interactive proofs with a laconic prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin Streaming Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Interactive Proofs of Proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arguments of Proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Deterministic Graph Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property Testing of Massively Parametrized Problems – A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: lgorithmic and Analysis Techniques in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs of proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiparty communication complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient checking of polynomials and proofs and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Streaming Algorithms for Annotated Graph Streams / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:19, 15 July 2024

scientific article
Language Label Description Also known as
English
Non-interactive proofs of proximity
scientific article

    Statements

    Non-interactive proofs of proximity (English)
    0 references
    0 references
    0 references
    18 April 2018
    0 references
    property testing
    0 references
    probabilistic proof systems
    0 references
    proofs of proximity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers