An Algebraic Characterization of Testable Boolean CSPs (Q5326555): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/978-3-642-39206-1_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W22128777 / 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: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity testing over general poset domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the testable graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and parameter testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for testing linear‐invariant properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems: Refining Schaefer's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing st-Connectivity / 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: Undirected connectivity in log-space / rank
 
Normal rank

Latest revision as of 18:08, 6 July 2024

scientific article; zbMATH DE number 6195419
Language Label Description Also known as
English
An Algebraic Characterization of Testable Boolean CSPs
scientific article; zbMATH DE number 6195419

    Statements

    An Algebraic Characterization of Testable Boolean CSPs (English)
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references