Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2021.103505 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3155946679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Algorithms for Unique Games and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog and constraint satisfaction with infinite templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model-Theoretic View on Qualitative Constraint Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Subexponential-Time Complexity of CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras and their application in temporal and spatial reasoning / 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: Complexity and algorithms for reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An initial study of time complexity in infinite-domain constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong partial clones and the time complexity of SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification of SAT and CSP Problems via Tractable Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems on intervals and unit intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Spatial Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Latest revision as of 00:50, 27 July 2024

scientific article
Language Label Description Also known as
English
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
scientific article

    Statements

    Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2021
    0 references
    constraint satisfaction problems
    0 references
    infinite domains
    0 references
    partition schemes
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers