Search Sciweavers | Sciweavers

1941 search results - page 14 / 389

» On the Hardness of Approximate Reasoning

click to vote

FOCS
1992
IEEE

133views Theoretical Computer Science» more FOCS 1992»

Proof Verification and Hardness of Approximation Problems

15 years 1 months ago

Download people.csail.mit.edu

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...

Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...

claim paper

Read More »

click to vote

APPROX
2008
Springer

128views Algorithms» more APPROX 2008»

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

14 years 11 months ago

Download www.cs.cmu.edu

Venkatesan Guruswami, Prasad Raghavendra

claim paper

Read More »

Voted

CPM
2008
Springer

132views Combinatorics» more CPM 2008»

Constrained LCS: Hardness and Approximation

14 years 11 months ago

Download cs.haifa.ac.il

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

claim paper

Read More »

click to vote

CORR
2008
Springer

83views Education» more CORR 2008»

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

14 years 9 months ago

Download www1.informatik.uni-wuerzburg.de

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...

claim paper

Read More »

click to vote

CORR
2008
Springer

99views Education» more CORR 2008»

Exponential-Time Approximation of Hard Problems

14 years 9 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers