On memoryless provers and insincere verifiers (Q3639202): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q261361 / rank
Normal rank
 
Property / author
 
Property / author: K. Subramani and Vahan Mkrtchyan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09528130903119328 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965051705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to set constraint-based program analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms For Linear Inequalities with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of totally clairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: CASCADING RANDOM WALKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Latest revision as of 03:07, 2 July 2024

scientific article
Language Label Description Also known as
English
On memoryless provers and insincere verifiers
scientific article

    Statements

    On memoryless provers and insincere verifiers (English)
    0 references
    29 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    random walk
    0 references
    binary Boolean constraints
    0 references
    Chebyshev's inequality
    0 references
    type 3 certificates
    0 references
    Prover-Verifier model
    0 references
    0 references