Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Infinite-Domain Constraint Satisfaction / 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: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability in constraint satisfaction problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to tractable answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor Sets for CSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Ordering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constants and finite unary relations in qualitative constraint reasoning / 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: Q5005145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inverse Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors for linear temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / 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: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Revision as of 06:14, 31 July 2024

scientific article; zbMATH DE number 7639811
Language Label Description Also known as
English
Computational Short Cuts in Infinite Domain Constraint Satisfaction
scientific article; zbMATH DE number 7639811

    Statements

    Computational Short Cuts in Infinite Domain Constraint Satisfaction (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2023
    0 references
    constraint satisfaction
    0 references
    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
    0 references