Sciweavers

2610 search results - page 229 / 522
» Computational Probabilistic Non-interference
Sort
View
ICALP
2005
Springer
15 years 9 months ago
Noisy Turing Machines
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
Eugene Asarin, Pieter Collins
FOCS
1998
IEEE
15 years 8 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...
FOCS
1997
IEEE
15 years 8 months ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous
BIRTHDAY
2006
Springer
15 years 7 months ago
Quantum Institutions
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capt...
Carlos Caleiro, Paulo Mateus, Amílcar Serna...
120
Voted
DLOG
2010
15 years 2 months ago
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
Anni-Yasmin Turhan, Rafael Peñaloza