@inproceedings{e518a344c82f4f8eacafab1e55806da3,

title = "Space and time complexity of exact algorithms : some open problems",

abstract = "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.",

author = "G.J. Woeginger",

year = "2004",

doi = "10.1007/978-3-540-28639-4_25",

language = "English",

isbn = "3-540-23071-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "281--290",

editor = "R. Downey and M. Fellows and F. Dehne",

booktitle = "Parametrized and Exact Computation (Proceedings First International Workshop, IWPEC2004, Bergen, Norway, September 14-17, 2004)",

address = "Germany",

}