1711 search results - page 27 / 343 » Completing pseudojump operators |
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
QCQC
1998
Springer
14 years 18 hour ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
CAEPIA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we enrich the logic of order of magnitude qualitative reasoning by means of a new notion of negligibility which has very useful properties with respect to ...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
CLUSTER
2006
IEEE
13 years 11 months ago
2006
IEEE
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient complete exchange ...