406 search results - page 59 / 82 » Pseudorandomness and Combinatorial Constructions |
99
Voted
CORR
1998
Springer
15 years 10 days ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
89
Voted
GC
2010
Springer
14 years 11 months ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
105
click to vote
Publication
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
126
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
93
Voted
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...