JOURNAL ARTICLE

Machine-based methods in parameterized complexity theory

Yijia ChenJörg FlumMartin Grohe

Year: 2005 Journal:   Theoretical Computer Science Vol: 339 (2-3)Pages: 167-199   Publisher: Elsevier BV
Keywords:
Parameterized complexity Nondeterministic algorithm Hierarchy Decidability Complexity class Mathematics Class (philosophy) Analytical hierarchy Discrete mathematics Bounded function Computational complexity theory Computer science Time hierarchy theorem Polynomial hierarchy Theoretical computer science Turing machine Time complexity Algorithm Universal Turing machine Artificial intelligence Analytic hierarchy process Mathematical economics

Metrics

57
Cited By
11.20
FWCI (Field Weighted Citation Impact)
24
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Constraint Satisfaction and Optimization
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

BOOK-CHAPTER

Parameterized Complexity Theory

Ronald de Haan

Lecture notes in computer science Year: 2019 Pages: 33-41
BOOK-CHAPTER

PARAMETERIZED COMPLEXITY THEORY

Rolf Niedermeier

Year: 2006 Pages: 205-236
JOURNAL ARTICLE

Parameterized Complexity in Machine Learning

Robert Ganian

Journal:   Computer Science Review Year: 2025 Vol: 59 Pages: 100836-100836
© 2026 ScienceGate Book Chapters — All rights reserved.