Space and time complexity of exact algorithms : some open problems

G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

69 Citations (Scopus)


We discuss open questions around worst case time and space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior.
Original languageEnglish
Title of host publicationParametrized and Exact Computation (Proceedings First International Workshop, IWPEC2004, Bergen, Norway, September 14-17, 2004)
EditorsR. Downey, M. Fellows, F. Dehne
Place of PublicationBerlin
ISBN (Print)3-540-23071-8
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Space and time complexity of exact algorithms : some open problems'. Together they form a unique fingerprint.

Cite this