Parameterized Complexity in the Polynomial Hierarchy

Lieferzeit: Lieferbar innerhalb 14 Tagen

85,59 

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy, Lecture Notes in Computer Science 11880 – Theoretical Computer Science and General Issues

ISBN: 3662606690
ISBN 13: 9783662606698
Autor: de Haan, Ronald
Verlag: Springer Verlag GmbH
Umfang: xi, 398 S., 1349 s/w Illustr., 398 p. 1349 illus.
Erscheinungsdatum: 31.12.2019
Auflage: 1/2020
Produktform: Kartoniert
Einband: Kartoniert
Artikelnummer: 8133875 Kategorie:

Beschreibung

Autorenporträt

Ronald de Haan is a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam.His research interests include the application of methods from theoretical computer sciencein particular methods from (parameterized) complexity theoryto problems in computational logic, artificial intelligence (AI), and knowledge representation & reasoning (KRR).He wrote his PhD thesistitled Parameterized Complexity in the Polynomial Hierarchyat the Algorithms and Complexity Group at the Faculty of Informatics of the Technische Universität Wien. He received his PhD in 2016. His PhD thesis was awarded the E.W. Beth Dissertation Prize 2017, was shortlisted for the Heinz Zemanek Prize 2018, and was nominated for the GI-Dissertationspreis 2016 of the German Informatics Society.

Herstellerkennzeichnung:


Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

E-Mail: juergen.hartmann@springer.com

Das könnte Ihnen auch gefallen …