Sciweavers

7840 search results - page 204 / 1568
» On generalized Ramsey numbers
Sort
View
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
15 years 5 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 1 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
IACR
2011
173views more  IACR 2011»
14 years 6 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 23 days ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...