Search Sciweavers | Sciweavers

3758 search results - page 27 / 752

» A Complete Subsumption Algorithm

click to vote

COCO
2010
Springer

180views Algorithms» more COCO 2010»

Completely Inapproximable Monotone and Antimonotone Parameterized Problems

13 years 11 months ago

Download www.cs.bme.hu

We prove that weighted monotone/antimonotone circuit satisﬁability has no ﬁxed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...

Dániel Marx

claim paper

Read More »

click to vote

STOC
2007
ACM

82views Algorithms» more STOC 2007»

Interval completion with few edges

14 years 7 months ago

Download www.ii.uib.no

Pinar Heggernes, Christophe Paul, Jan Arne Telle, ...

claim paper

Read More »

click to vote

SODA
2010
ACM

163views Algorithms» more SODA 2010»

SRPT is 1.86-Competitive for Completion Time Scheduling

14 years 5 months ago

Download www.nonner.de

Christine Chung, Tim Nonner, Alexander Souza

claim paper

Read More »

click to vote

STOC
2004
ACM

94views Algorithms» more STOC 2004»

Completeness in two-party secure computation: a computational view

14 years 7 months ago

Download www.wisdom.weizmann.ac.il

Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen

claim paper

Read More »

click to vote

CIAC
2006
Springer

75views Algorithms» more CIAC 2006»

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes

13 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers