Parameterized Complexity Theory
J. Flum
Preliminaries; Finite automata and regular languages; Pushdown automata and context-free languages; Turing machines and phrase-structure languages; Computability; Complexity; Appendices.
Booko found 4 book editions
Product filters
Product |
Details
|
Price
|
New
|
Used
|
---|---|---|---|---|
|
New: Being refreshed...
Used: Being refreshed...
|
New: Being refreshed...
Used: Being refreshed...
|
Being refreshed... | Being refreshed... |
|
New: Being refreshed...
Used: Being refreshed...
|
New: Being refreshed...
Used: Being refreshed...
|
Being refreshed... | Being refreshed... |
|
New: Being refreshed...
Used: Being refreshed...
|
New: Being refreshed...
Used: Being refreshed...
|
Being refreshed... | Being refreshed... |
|
New: Being refreshed...
Used: Being refreshed...
|
New: Being refreshed...
Used: Being refreshed...
|
Being refreshed... | Being refreshed... |
Booko collects this information from user contributions and sources on the internet - it is not a definitive list of editions. Search Booko for other editions of Parameterized Complexity Theory.