Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889): Difference between revisions

From MaRDI portal
Add wikidata reference.
Import recommendations run Q6767936
 
Property / Recommended article
 
Property / Recommended article: On O(Tlog T) reduction from RAM computations to satisfiability / rank
 
Normal rank
Property / Recommended article: On O(Tlog T) reduction from RAM computations to satisfiability / qualifier
 
Similarity Score: 0.8790032
Amount0.8790032
Unit1
Property / Recommended article: On O(Tlog T) reduction from RAM computations to satisfiability / qualifier
 
Property / Recommended article
 
Property / Recommended article: Fast and parallel decomposition of constraint satisfaction problems / rank
 
Normal rank
Property / Recommended article: Fast and parallel decomposition of constraint satisfaction problems / qualifier
 
Similarity Score: 0.8749603
Amount0.8749603
Unit1
Property / Recommended article: Fast and parallel decomposition of constraint satisfaction problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5421814 / rank
 
Normal rank
Property / Recommended article: Q5421814 / qualifier
 
Similarity Score: 0.86021435
Amount0.86021435
Unit1
Property / Recommended article: Q5421814 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems / rank
 
Normal rank
Property / Recommended article: Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems / qualifier
 
Similarity Score: 0.8475303
Amount0.8475303
Unit1
Property / Recommended article: Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Sparsification of SAT and CSP Problems via Tractable Extensions / rank
 
Normal rank
Property / Recommended article: Sparsification of SAT and CSP Problems via Tractable Extensions / qualifier
 
Similarity Score: 0.84601057
Amount0.84601057
Unit1
Property / Recommended article: Sparsification of SAT and CSP Problems via Tractable Extensions / qualifier
 
Property / Recommended article
 
Property / Recommended article: Reoptimization of constraint satisfaction problems with approximation resistant predicates / rank
 
Normal rank
Property / Recommended article: Reoptimization of constraint satisfaction problems with approximation resistant predicates / qualifier
 
Similarity Score: 0.84558874
Amount0.84558874
Unit1
Property / Recommended article: Reoptimization of constraint satisfaction problems with approximation resistant predicates / qualifier
 
Property / Recommended article
 
Property / Recommended article: The approximability of constraint satisfaction problems / rank
 
Normal rank
Property / Recommended article: The approximability of constraint satisfaction problems / qualifier
 
Similarity Score: 0.83888125
Amount0.83888125
Unit1
Property / Recommended article: The approximability of constraint satisfaction problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: New schemes for simplifying binary constraint satisfaction problems / rank
 
Normal rank
Property / Recommended article: New schemes for simplifying binary constraint satisfaction problems / qualifier
 
Similarity Score: 0.8381044
Amount0.8381044
Unit1
Property / Recommended article: New schemes for simplifying binary constraint satisfaction problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: An efficient algorithm for a class of constraint satisfaction problems / rank
 
Normal rank
Property / Recommended article: An efficient algorithm for a class of constraint satisfaction problems / qualifier
 
Similarity Score: 0.8374158
Amount0.8374158
Unit1
Property / Recommended article: An efficient algorithm for a class of constraint satisfaction problems / qualifier
 

Latest revision as of 04:01, 9 May 2025

scientific article
Language Label Description Also known as
English
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
scientific article

    Statements

    Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2017
    0 references
    delegation of computation
    0 references
    probabilistically checkable proofs
    0 references
    random-access machines
    0 references
    succinct arguments
    0 references
    zero-knowledge proofs
    0 references

    Identifiers

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