923 search results - page 91 / 185 » On a generalization of Stickelberger's Theorem |
169
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
102
click to vote
MLQ
2007
15 years 5 months ago
2007
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
136
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...
183
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
206
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...