The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Bibliografske podrobnosti
Main Authors:	Gottlob, G, Greco, G, Scarcello, F
Format:	Conference item
Izdano:	Professional Book Center 2005

Podobne knjige/članki

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
od: Gottlob, G, et al.
Izdano: (2017)

Conditional Constraint Satisfaction: Logical Foundations and Complexity
od: Gottlob, G, et al.
Izdano: (2007)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

HyperConsistency Width For Constraint Satisfaction
od: Marnette, B, et al.
Izdano: (2009)

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, et al.
Izdano: (1997)

On the Complexity of Some Inductive Logic Programming Problems
od: Gottlob, G, et al.
Izdano: (1999)

Fast and parallel decomposition of constraint satisfaction problems
od: Gottlob, G, et al.
Izdano: (2020)

Fast and parallel decomposition of constraint satisfaction problems
od: Gottlob, G, et al.
Izdano: (2022)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
od: Chen, H, et al.
Izdano: (2020)

Pure Nash Equilibria: Hard and Easy Games
od: Gottlob, G, et al.
Izdano: (2005)

Pure Nash equilibria: hard and easy games
od: Gottlob, G, et al.
Izdano: (2003)

The complexity of acyclic conjunctive queries
od: Gottlob, G, et al.
Izdano: (2001)

The Complexity of Acyclic Conjunctive Queries
od: Gottlob, G, et al.
Izdano: (1998)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
od: Gottlob, G, et al.
Izdano: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
od: Gottlob, G, et al.
Izdano: (2002)

The constraint satisfaction problem: complexity and approximability
od: Krokhin, A, et al.
Izdano: (2017)

The complexity of valued constraint satisfaction problems
od: Živný, S
Izdano: (2012)

Quantified constraints: algorithms and complexity
od: Börner, F, et al.
Izdano: (2003)

Quantified constraints: Algorithms and complexity
od: Borner, F, et al.
Izdano: (2003)

A Comparison of Structural CSP Decomposition Methods
od: Gottlob, G, et al.
Izdano: (1999)

A comparison of structural CSP decomposition methods
od: Gottlob, G, et al.
Izdano: (2000)

The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
od: Manuel Bodirsky, et al.
Izdano: (2020-02-01)

Hypertree decompositions: questions and answers
od: Gottlob, G, et al.
Izdano: (2016)

Quantified Constraints and Containment Problems
od: Barnaby D. Martin, et al.
Izdano: (2015-09-01)

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics.
od: Abramsky, S, et al.
Izdano: (2013)

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics
od: Abramsky, S, et al.
Izdano: (2013)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
od: Gottlob, G, et al.
Izdano: (2007)

Relativized Logspace and Generalized Quantifiers over Finite Structures
od: Gottlob, G
Izdano: (1995)

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures
od: Gottlob, G
Izdano: (1997)

Semantic acyclicity under constraints
od: Gottlob, G, et al.
Izdano: (2016)

Semantic acyclicity under constraints
od: Barceló, P, et al.
Izdano: (2016)

The complexity of soft constraint satisfaction
od: Cohen, D, et al.
Izdano: (2006)

The complexity of soft constraint satisfaction
od: Cohen, D, et al.
Izdano: (2006)

On the valued constraint satisfaction problem
od: Fulla, P
Izdano: (2018)

Promise constraint satisfaction problems
od: Brandts-Longtin, A
Izdano: (2022)

Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories
od: Hanna Schölzel, et al.
Izdano: (2012-08-01)

A Survey of Tractable Constraint Satisfaction Problems
od: J.K.Pearson, et al.
Izdano: (1997)

The complexity of constraint satisfaction games and QCSP
od: Börner, F, et al.
Izdano: (2009)

The complexity of constraint satisfaction games and QCSP
od: Boerner, F, et al.
Izdano: (2009)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
od: Gottlob, G, et al.
Izdano: (2005)