923 search results - page 141 / 185 » On a generalization of Stickelberger's Theorem |
116
click to vote
LOGCOM
2010
14 years 10 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
110
click to vote
SAC
2010
ACM
14 years 9 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
STOC
1997
ACM
15 years 4 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
SIGGRAPH
1999
ACM
15 years 4 months ago
1999
ACM
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...