×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [polynomialtime algorithm]
1 The Theory of NP-Completeness 2012/11/6 P: the class of problems which can be solved by a deterministic polynomial algorithm. NP : the class of decision
217 views
On Sparsification for Computing Treewidth
31 views
1 CSC 421: Algorithm Design & Analysis Spring 2014 Complexity & Computability complexity theory tractability, decidability P vs. NP, Turing machines
219 views
February 18, 2015CS21 Lecture 181 CS21 Decidability and Tractability Lecture 18 February 18, 2015
221 views
Tonga Institute of Higher Education Design and Analysis of Algorithms
31 views
Computational Molecular Biology Introduction and Preliminaries
219 views
Chapter 10 Complexity of Approximation (1) L-Reduction
41 views
Slides by Asaf Shapira & Michael Lewin & Boaz Klartag & Oded Schwartz
14 views
CS 312: Algorithm Analysis Lecture #38: Approximation Algorithms and Local Search Credit: Tony Martinez, Eric Ringger, and some figures from Dasgupta et
224 views
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems
53 views
Almost Optimal Set Covers in Finite VC-Dimension
11 views
Lattice Based Signatures
49 views
< Prev
Next >