The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Podobne zapisy

• Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
  od: Gottlob, G, i wsp.
  Wydane: (2017)
• Conditional Constraint Satisfaction: Logical Foundations and Complexity
  od: Gottlob, G, i wsp.
  Wydane: (2007)
• On Tractable Queries and Constraints
  od: Gottlob, G, i wsp.
  Wydane: (1999)
• On the Complexity of Some Inductive Logic Programming Problems
  od: Gottlob, G, i wsp.
  Wydane: (1997)
• On the Complexity of Some Inductive Logic Programming Problems
  od: Gottlob, G, i wsp.
  Wydane: (1999)