Sciweavers

827 search results - page 3 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
CSR
2011
Springer
13 years 2 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 11 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
IPL
2007
125views more  IPL 2007»
13 years 10 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
IJAR
2008
106views more  IJAR 2008»
13 years 11 months ago
Probabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
Fabio Gagliardi Cozman, Cassio Polpo de Campos, Jo...
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
13 years 5 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo