787 search results - page 122 / 158 » Polynomial Constants are Decidable |
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
CAAN
2007
Springer
14 years 1 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...