Results 31 to 40 of about 943 (76)

Very narrow quantum OBDDs and width hierarchies for classical OBDDs

, 2014
We present several results on comparative complexity for different variants of OBDD models. - We present some results on comparative complexity of classical and quantum OBDDs. We consider a partial function depending on parameter k such that for any k >
Ablayev, Farid, Gainutdinova, Aida, Khadiev, Kamil, Yakarylmaz, Abuzer   +3 more
core   +1 more source

Processing Succinct Matrices and Vectors

, 2014
We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of a semiring ...
A. Bertoni, A. Storjohann, B. Grenet, C. Damm, C. Mereghetti, C. Àlvarez, D. Eppstein, G. Malod, H. Caussinus, H. Galperin, H. Lenstra, I. Wegener, M. Beaudry, M. Fujita, M. Galota, M. Lohrey, M. Lohrey, P. Berman, R.E. Bryant, R.E. Ladner, S. Toda, W. Plandowski   +21 more
core   +1 more source

Binary Decision Diagrams: from Tree Compaction to Sampling

, 2020
Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique ...
A Genitrini, C Gröpl, C Martínez, DE Knuth, J Newton, K Claessen, P Flajolet, P Flajolet, P Flajolet, RE Bryant   +9 more
core   +1 more source

Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol [PDF]

, 2006
We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity
Kacprzak, M., Lomuscio, A., Niewiadomski, A., Penczek, W., Raimondi, F., Szreter, M.   +5 more
core  

On Computational Power of Quantum Read-Once Branching Programs

, 2011
In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we ...
Alexander Vasiliev, Alexander Vasiliev, Andrew Chi-Chih Yao, Andris Ambainis, Andris Ambainis, Bob Coecke, Cristopher Moore, David Deutsch, Farid Ablayev, Farid Ablayev, Farid Ablayev, Farid Ablayev, Farid Ablayev, Farid Ablayev, Harry Buhrman, Ingo Wegener, Jawahar Jain, Martin Sauerhoff, Martin Sauerhoff, Masaki Nakanishi, Rajeev Motwani, Ronald de Wolf, Vishwani Agrawal   +22 more
core   +2 more sources

Connecting Width and Structure in Knowledge Compilation [PDF]

, 2018
Several query evaluation tasks can be done via knowledge compilation: the query result is compiled as a lineage circuit from which the answer can be determined.
, Amarilli, Antoine, Senellart, Pierre
core   +7 more sources

On the Role of Canonicity in Bottom-up Knowledge Compilation [PDF]

, 2014
We consider the problem of bottom-up compilation of knowledge bases, which is usually predicated on the existence of a polytime function for combining compilations using Boolean operators (usually called an Apply function).
Broeck, Guy Van den, Darwiche, Adnan
core   +2 more sources

Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs

, 2019
In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known deterministic ...
A Ambainis, A Ambainis, A Ambainis, AM Childs, C Dürr, C Dürr, F Ablayev, F Ablayev, F Ablayev, F Ablayev, F Ablayev, F Gall Le, G Brassard, I Zhegalkin, K Khadiev, K Khadiev, M Boyer, MA Nielsen, R Ibrahimov, S Arora, S Dörn, SG Gindikin, SV Yablonsky, TH Cormen   +23 more
core   +1 more source

Algorithms for Quantum Branching Programs Based on Fingerprinting

, 2009
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs).
Ablayev, Farid, Vasiliev, Alexander
core   +2 more sources

Transient Reward Approximation for Continuous-Time Markov Chains

, 2015
We are interested in the analysis of very large continuous-time Markov chains (CTMCs) with many distinct rates. Such models arise naturally in the context of reliability analysis, e.g., of computer network performability analysis, of power grids, of ...
Becker, Bernd, Hahn, Ernst Moritz, Hermanns, Holger, Wimmer, Ralf   +3 more
core   +1 more source