Sciweavers

105 search results - page 16 / 21
» On the subset sum problem over finite fields
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
HPDC
2002
IEEE
14 years 10 days ago
Using Kernel Couplings to Predict Parallel Application Performance
Performance models provide significant insight into the performance relationships between an application and the system used for execution. The major obstacle to developing perfor...
Valerie E. Taylor, Xingfu Wu, Jonathan Geisler, Ri...
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 11 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
DAM
2008
68views more  DAM 2008»
13 years 7 months ago
Multiple packing in sum-type metric spaces
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...
Rudolf Ahlswede, Vladimir Blinovsky
ICALP
1998
Springer
13 years 11 months ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin