Sciweavers

220 search results - page 24 / 44
» New degree bounds for polynomial threshold functions
Sort
View
MST
2010
78views more  MST 2010»
14 years 10 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
FOCS
2003
IEEE
15 years 5 months ago
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
Timothy M. Chan
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 6 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro
FOCS
1990
IEEE
15 years 3 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
EUROCRYPT
2006
Springer
15 years 3 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld