Testing list \(H\)-homomorphisms (Q347111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/s00037-014-0093-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2462341721 / 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: Testing satisfiability / 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: A unified framework for testing linear‐invariant properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Characterization of Testable Boolean CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Unanimity Functions and Varieties of Reflexive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-coloring dichotomy revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems raised from 2-semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Results on the Algebraic Approach to the CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing st-Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the list homomorphism problem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / 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: Monotonicity testing over general poset domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Testing Graph Properties / 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: 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 the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / 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: lgorithmic and Analysis Techniques in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the \((s,t)\) connectivity of graphs and digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:13, 13 July 2024

scientific article
Language Label Description Also known as
English
Testing list \(H\)-homomorphisms
scientific article

    Statements

    Testing list \(H\)-homomorphisms (English)
    0 references
    0 references
    30 November 2016
    0 references
    property testing
    0 references
    list \(H\)-homomorphism
    0 references
    universal algebra
    0 references
    constraint satisfaction problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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