The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Detalhes bibliográficos
Main Authors:	Gottlob, G, Greco, G, Scarcello, F
Formato:	Conference item
Publicado em:	Professional Book Center 2005

Registos relacionados

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

Conditional Constraint Satisfaction: Logical Foundations and Complexity
Por: Gottlob, G, et al.
Publicado em: (2007)

On Tractable Queries and Constraints
Por: Gottlob, G, et al.
Publicado em: (1999)

On the Complexity of Some Inductive Logic Programming Problems
Por: Gottlob, G, et al.
Publicado em: (1997)

On the Complexity of Some Inductive Logic Programming Problems
Por: Gottlob, G, et al.
Publicado em: (1999)

HyperConsistency Width For Constraint Satisfaction
Por: Marnette, B, et al.
Publicado em: (2009)

Fast and parallel decomposition of constraint satisfaction problems
Por: Gottlob, G, et al.
Publicado em: (2020)

Fast and parallel decomposition of constraint satisfaction problems
Por: Gottlob, G, et al.
Publicado em: (2022)

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

Pure Nash Equilibria: Hard and Easy Games
Por: Gottlob, G, et al.
Publicado em: (2005)

Pure Nash equilibria: hard and easy games
Por: Gottlob, G, et al.
Publicado em: (2003)

The complexity of acyclic conjunctive queries
Por: Gottlob, G, et al.
Publicado em: (2001)

The Complexity of Acyclic Conjunctive Queries
Por: Gottlob, G, et al.
Publicado em: (1998)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
Por: Gottlob, G, et al.
Publicado em: (1999)

Fixed−parameter complexity in AI and nonmonotonic reasoning
Por: Gottlob, G, et al.
Publicado em: (2002)

The constraint satisfaction problem: complexity and approximability
Por: Krokhin, A, et al.
Publicado em: (2017)

The complexity of valued constraint satisfaction problems
Por: Živný, S
Publicado em: (2012)

Quantified constraints: algorithms and complexity
Por: Börner, F, et al.
Publicado em: (2003)

Quantified constraints: Algorithms and complexity
Por: Borner, F, et al.
Publicado em: (2003)

A Comparison of Structural CSP Decomposition Methods
Por: Gottlob, G, et al.
Publicado em: (1999)

A comparison of structural CSP decomposition methods
Por: Gottlob, G, et al.
Publicado em: (2000)

Hypertree decompositions: questions and answers
Por: Gottlob, G, et al.
Publicado em: (2016)

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

Quantified Constraints and Containment Problems
Por: Barnaby D. Martin, et al.
Publicado em: (2015-09-01)

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

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

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

Relativized Logspace and Generalized Quantifiers over Finite Structures
Por: Gottlob, G
Publicado em: (1995)

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures
Por: Gottlob, G
Publicado em: (1997)

Semantic acyclicity under constraints
Por: Gottlob, G, et al.
Publicado em: (2016)

Semantic acyclicity under constraints
Por: Barceló, P, et al.
Publicado em: (2016)

The complexity of soft constraint satisfaction
Por: Cohen, D, et al.
Publicado em: (2006)

The complexity of soft constraint satisfaction
Por: Cohen, D, et al.
Publicado em: (2006)

On the valued constraint satisfaction problem
Por: Fulla, P
Publicado em: (2018)

Promise constraint satisfaction problems
Por: Brandts-Longtin, A
Publicado em: (2022)

Random Constraint Satisfaction Problems
Por: Amin Coja-Oghlan
Publicado em: (2009-11-01)

A Survey of Tractable Constraint Satisfaction Problems
Por: J.K.Pearson, et al.
Publicado em: (1997)

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

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

The complexity of constraint satisfaction games and QCSP
Por: Boerner, F, et al.
Publicado em: (2009)