- Part I Uniform Complexity 1 1 Models of Computation and Complexity Classes 3
- Problem Solving in Automata, Languages, and Complexity
- CSE548, Spring 2011 Solutions/Hints to Homework 5
- CSE548, Spring 2011 Solutions/Hints to Homework 2
- CSE548, Spring 2011 Solutions/Hints to Homework 4
- Theory of Computational Complexity by DingZhu Du and KerI Ko
- Constructing Oracles by Lower Bound Techniques for Circuits 1
- Complexity Theory of Real Functions State University of New York at Stony Brook
- April 10, 2003 14:50 WSPC/Trim Size: 9in x 6in for Proceedings ws COMPUTATIONAL COMPLEXITY OF FRACTALS
- Polynomial-Time Computability in Analysis Department of Computer Science
- CSE548, Spring 2011 Solutions/Hints to Homework 1
- Problem Solving in Automata, Languages, and Complexity
- Polynomial-Time Computability in Analysis: A Survey
- CSE548, Spring 2011 Solutions/Hints to Homework 3
- Problem Solving in Automata, Languages, and Complexity
- An approximation algorithm is an efficient algorithm that produces solutions to an optimization problem that are guaranteed to be within a fixed ratio of the optimal
- CSE303, Fall 2011 Solutions to Homework 5
- CSE303, Fall 2011 Solutions to Homework 3
- CSE303, Fall 2011 Solutions to Homework 2
- CSE303, Fall 2011 Solutions to Homework 4