Sciweavers

2767 search results - page 38 / 554
» Universal Exponentiation Algorithm
Sort
View
CIAC
2006
Springer
76views Algorithms» more  CIAC 2006»
14 years 1 months ago
Universal Relations and #P-Completeness
Hervé Fournier, Guillaume Malod
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 12 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 2 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
JSC
2006
81views more  JSC 2006»
13 years 10 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
TIT
2011
157views more  TIT 2011»
13 years 4 months ago
Universal and Composite Hypothesis Testing via Mismatched Divergence
—For the universal hypothesis testing problem, where the goal is to decide between the known null hypothesis distribution and some other unknown distribution, Hoeffding proposed ...
Jayakrishnan Unnikrishnan, Dayu Huang, Sean P. Mey...