Fixed Structure Complexity

DOI10.1007/978-3-540-79723-4_5zbMath1142.68358MaRDI QIDQ3503576

Yair Dombb, Yonatan Aumann

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_5

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R01: General topics of discrete mathematics in relation to computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

A Parameterized Halting Problem, A Logic for PTIME and a Parameterized Halting Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation Models for Parameterized Complexity
• When is the evaluation of conjunctive queries tractable?
• The undecidability of the domino problem