Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q130371181, #quickstatements; #temporary_batch_1729469299256
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2462227731 / 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: Fundamentals of Computation Theory / 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: The complexity of theorem-proving procedures / 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: Property testing and its connection to learning and approximation / 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 Proximity-Oblivious Testing / 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: Lower bounds on the complexity of real-time branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Membership in Languages that Have Small Width Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780800 / 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: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs of proximity / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130371181 / rank
 
Normal rank

Latest revision as of 01:30, 21 October 2024

scientific article
Language Label Description Also known as
English
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
scientific article

    Statements

    Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references