923 search results - page 49 / 185 » On a generalization of Stickelberger's Theorem |
177
click to vote
EJC
2007
15 years 6 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
166
click to vote
DAM
2008
15 years 6 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
160
click to vote
CIE
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
149
click to vote
TARK
2007
Springer
16 years 7 days ago
2007
Springer
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
159
click to vote
ISIPTA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper argues in favor of the thesis that two different concepts of conditional interval probability are needed, in order to serve the huge variety of tasks conditional probab...