Space and time complexity of exact algorithms: some open problems
Gerhard J. Woeginger
Proc. 1st Int. Worksh. Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science 3162, Rod Downey,
Michael Fellows,
and Frank K. H. A. Dehne, ed., Springer-Verlag, Sep 2004, pp. 281–290
Cites:
