923 search results - page 123 / 185 » On a generalization of Stickelberger's Theorem |
ISSAC
2009
Springer
15 years 6 months 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...
FOSSACS
2010
Springer
15 years 6 months 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-...
ASIACRYPT
2007
Springer
15 years 6 months 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...
COLT
2004
Springer
15 years 5 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...
104
click to vote
SAIG
2001
Springer
15 years 4 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...