2661 search results - page 65 / 533 » Quantum Complexity Classes |
132
click to vote
ANTS
2008
Springer
15 years 5 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
139
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
140
click to vote
TOCL
2008
15 years 3 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
126
click to vote
VLSISP
2002
15 years 2 months ago
2002
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
166
click to vote
DKE
2011
14 years 10 months ago
2011
One of the more tedious and complex tasks during the specification of conceptual schemas (CSs) is modeling the operations that define the system behavior. This paper aims to simpl...