Sciweavers

3415 search results - page 71 / 683
» Lower Bounds for Kernelizations
Sort
View
110
Voted
CEC
2009
IEEE
15 years 7 months ago
Towards an evolved lower bound for the most circular partition of a square
— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
Claudia Obermaier, Markus Wagner
COCOON
2009
Springer
15 years 7 months ago
An Improved Time-Space Lower Bound for Tautologies
Scott Diehl, Dieter van Melkebeek, Ryan Williams
98
Voted
ISSAC
2009
Springer
161views Mathematics» more  ISSAC 2009»
15 years 7 months ago
Lower bounds for zero-dimensional projections
W. Dale Brownawell, Chee K. Yap
83
Voted
SIGECOM
2009
ACM
102views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
An optimal lower bound for anonymous scheduling mechanisms
Itai Ashlagi, Shahar Dobzinski, Ron Lavi