<--- Back to Details
First PageDocument Content
Prime numbers / Complex analysis / Pi / Prime-counting function / Randomized algorithm / Permutation pattern / MAX-3SAT / Mathematical analysis / Mathematics / Analytic number theory
Date: 2007-03-26 09:22:56
Prime numbers
Complex analysis
Pi
Prime-counting function
Randomized algorithm
Permutation pattern
MAX-3SAT
Mathematical analysis
Mathematics
Analytic number theory

How to Rank with Few Errors ∗

Add to Reading List

Source URL: cs.brown.edu

Download Document from Source Website

File Size: 181,33 KB

Share Document on Facebook

Similar Documents

Biology / Genomics / Computational complexity theory / Bioinformatics / MAX-3SAT / Comparative genomics / Genome / Gene / Vertex cover

Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du Qu

DocID: 1qIfg - View Document

Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Mathematical optimization / NP-hard problems / MAX-3SAT / NP / Approximation algorithm / Probabilistically checkable proof / PCP theorem / APX

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

DocID: 1mroB - View Document

Complexity classes / Circuit complexity / NC / NP / Gap reduction / MAX-3SAT

RevCalcDisc_MGnewuch_et_al.dvi

DocID: 1jjJM - View Document

Quantum complexity theory / Probabilistic complexity theory / Models of computation / Analysis of algorithms / Randomized algorithm / PP / Decision tree model / IP / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

DocID: 1aKTH - View Document