Sciweavers

3758 search results - page 27 / 752
» A Complete Subsumption Algorithm
Sort
View
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
15 years 1 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
STOC
2007
ACM
82views Algorithms» more  STOC 2007»
15 years 10 months ago
Interval completion with few edges
Pinar Heggernes, Christophe Paul, Jan Arne Telle, ...
54
Voted
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
15 years 7 months ago
SRPT is 1.86-Competitive for Completion Time Scheduling
Christine Chung, Tim Nonner, Alexander Souza
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
15 years 10 months ago
Completeness in two-party secure computation: a computational view
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
64
Voted
CIAC
2006
Springer
75views Algorithms» more  CIAC 2006»
15 years 1 months ago
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Katalin Friedl, Gábor Ivanyos, Miklos Santh...