1215 search results - page 229 / 243 » Combinatorics |
ECCC
2007
14 years 9 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...
101
click to vote
MST
2006
14 years 9 months ago
2006
Abstract. Many researchers have had fun searching for and rendering symmetric Venn diagrams, culminating in the recent result of Griggs, Killian, and Savage ("Venn Diagrams an...
TALG
2008
14 years 9 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
80
Voted
TCS
2008
14 years 9 months ago
2008
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
85
Voted
TCS
2008
14 years 9 months ago
2008
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...