×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [input of length n]
CS151 Complexity Theory Lecture 4 April 11, 2013
216 views
Lecture15x (1)
215 views
Polynomial-time reductions We have seen several reductions:
222 views
–Def: A language L is in BPP c,s ( 0 s(n) c(n) 1, n N) if there exists a probabilistic poly-time TM M s.t. : 1. w L, Pr[M accepts w] c(|w|),
213 views
CSCI 2670 Introduction to Theory of Computing November 10, 2005
213 views
Introduction to the Analysis of Complexity
36 views
Intractable Problems
26 views
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
239 views
Deterministic and Randomized Quicksort Andreas Klappenecker
247 views
CS21 Decidability and Tractability
42 views