Search Sciweavers | Sciweavers

757 search results - page 19 / 152

» On the hardness of approximating Max-Satisfy

106

click to vote

IJCAI
1993

64views Artificial Intelligence» more IJCAI 1993»

On the Hardness of Approximate Reasoning

15 years 7 months ago

Download l2r.cs.uiuc.edu

Dan Roth

claim paper

Read More »

101

click to vote

CORR
2008
Springer

83views Education» more CORR 2008»

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

15 years 6 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

15 years 6 months ago

Download www.mimuw.edu.pl

Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mat...

claim paper

Read More »

click to vote

CORR
2007
Springer

53views Education» more CORR 2007»

On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

15 years 6 months ago

Download www.cs.umass.edu

Andrew McGregor, Olgica Milenkovic

claim paper

Read More »

143

click to vote

JCO
2008

78views more JCO 2008»

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems

15 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers