Sciweavers

508 search results - page 79 / 102
» Poly-locality in quantum computing
Sort
View
CF
2007
ACM
13 years 11 months ago
Converting massive TLP to DLP: a special-purpose processor for molecular orbital computations
We propose an application specific processor for computational quantum chemistry. The kernel of interest is the computation of electron repulsion integrals (ERIs), which vary in c...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 1 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
IJMMS
2000
70views more  IJMMS 2000»
13 years 7 months ago
Computer generation of process explanations in nuclear astrophysics
In this paper we describe Astra, a computational aid for generating process explanations in nuclear astrophysics. The system operates in two stages, the rst using knowledge of qua...
Sakir Kocabas, Pat Langley
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
FCT
2005
Springer
14 years 29 days ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...