Pages that link to "Item:Q3771663"

The following pages link to A sufficient condition for backtrack-bounded search (Q3771663):

Displaying 42 items.

• Computing and restoring global inverse consistency in interactive constraint satisfaction (Q334804) (← links)
• Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
• Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
• Hypertree decompositions and tractable queries (Q696962) (← links)
• A polynomial relational class of binary CSP (Q722101) (← links)
• Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
• On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
• Local consistency for extended CSPs (Q1035707) (← links)
• Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
• Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646) (← links)
• Constraints, consistency and closure (Q1274280) (← links)
• Fast parallel constraint satisfaction (Q1313952) (← links)
• Counting representable sets on simple graphs (Q1314321) (← links)
• Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
• Characterising tractable constraints (Q1321064) (← links)
• Model-based inference in CHARME. (Q1342427) (← links)
• On computing minimal models (Q1380414) (← links)
• Fugitive-search games on graphs and related parameters (Q1392025) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• Decomposable constraints (Q1589469) (← links)
• A comparison of structural CSP decomposition methods (Q1589639) (← links)
• Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
• Accelerating filtering techniques for numeric CSPs (Q1606118) (← links)
• Disjunctions, independence, refinements (Q1614865) (← links)
• Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
• A new tractable class of constraint satisfaction problems (Q1776199) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• Propositional semantics for disjunctive logic programs (Q1924819) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• Default reasoning using classical logic (Q2171265) (← links)
• ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
• Neighborhood singleton consistencies (Q2331105) (← links)
• Domain filtering consistencies for non-binary constraints (Q2389637) (← links)
• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
• Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• An algebraic characterization of tractable constraints (Q6085763) (← links)