215 search results - page 16 / 43 » Quantum computers that can be simulated classically in polyn... |
137
click to vote
ASM
2005
ASM
15 years 11 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
138
click to vote
ICTAI
1994
IEEE
15 years 10 months ago
1994
IEEE
An object-oriented neural network simulator kernel is presented. It is based on a general mathematical model for arbitrary feedforward nets. We propose a C++ implementation of thi...
171
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
167
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
166
click to vote
TC
2008
15 years 6 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...