1. Algorithms in Real Algebraic Geometry,1988
2. Proof Verification and Hardness of Approximation Problems;Arora;J. of the ACM (JACM),1998
3. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
4. A characterization of the class of functions computable in polynomial time on random access machines;Bertoni;Proc. 13th Annual ACM Sym. on the Theory of Computing,1981
5. Dynamic programming on graphs of bounded treewidth;Bodlaende;Proc. 15th International Colloquium on Automata Languages and Programming (ICALP), LNCS,1988