923 search results - page 123 / 185 » On a generalization of Stickelberger's Theorem |
143
click to vote
ISSAC
2009
Springer
16 years 22 days ago
2009
Springer
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...
147
click to vote
FOSSACS
2010
Springer
16 years 20 days ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
136
click to vote
ASIACRYPT
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
157
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
166
click to vote
SAIG
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...