1511 search results - page 6 / 303 » Randomness, lowness and degrees |
PATMOS
2004
Springer
15 years 5 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
106
click to vote
CANS
2009
Springer
15 years 6 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
ESA
1994
Springer
15 years 3 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
ECCC
2007
14 years 11 months ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if 4 and mad(G) < 14 5 , then i(G...