Upload File

The top documents tagged [polynomialtime algorithm]

Graph colouring
Graph colouring
135 views
Voronoi-based Nearest Neighbor Search for Multi-Dimensional Uncertain Databases Peiwu Zhang Reynold Cheng Nikos Mamoulis Yu Tang University of Hong Kong
Voronoi-based Nearest Neighbor Search for Multi-Dimensional Uncertain Databases Peiwu Zhang Reynold Cheng Nikos Mamoulis Yu Tang University of Hong Kong
221 views
How NP got a new definition: Probabilistically Checkable Proofs (PCPs) & Approximation Properties of NP-hard problems SANJEEV ARORA PRINCETON UNIVERSITY
How NP got a new definition: Probabilistically Checkable Proofs (PCPs) & Approximation Properties of NP-hard problems SANJEEV ARORA PRINCETON UNIVERSITY
217 views
Chapter 10 Complexity of Approximation (1) L-Reduction Ding-Zhu Du
Chapter 10 Complexity of Approximation (1) L-Reduction Ding-Zhu Du
226 views
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb 8 2007 Jerry Le jlle@cse.cuhk.edu.hk
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb 8 2007 Jerry Le [email protected]
226 views
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique
213 views
Pseudorandom Bit Generation Artur Gadomski Piero Giammarino Henrik Goldman Massimo Giulio Caterino
Pseudorandom Bit Generation Artur Gadomski Piero Giammarino Henrik Goldman Massimo Giulio Caterino
226 views
Coloring random graphs online without creating monochromatic subgraphs Torsten Mütze, ETH Zürich Joint work with Thomas Rast (ETH Zürich) and Reto Spöhel
Coloring random graphs online without creating monochromatic subgraphs Torsten Mütze, ETH Zürich Joint work with Thomas Rast (ETH Zürich) and Reto Spöhel
227 views
Linear Programming and Smoothed Complexity Richard Kelley
Linear Programming and Smoothed Complexity Richard Kelley
221 views
Hardness Results for Problems Example Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique
Hardness Results for Problems Example Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique
215 views
Lecture 5 Overview Does DES Work? Differential Cryptanalysis Idea – Use two plaintext that barely differ – Study the difference in the corresponding
Lecture 5 Overview Does DES Work? Differential Cryptanalysis Idea – Use two plaintext that barely differ – Study the difference in the corresponding
215 views
Vladimir Protasov (Moscow State University, Russia) Invariant polyhedra for families of linear operators
Vladimir Protasov (Moscow State University, Russia) Invariant polyhedra for families of linear operators
224 views