Sciweavers

215 search results - page 16 / 43
» Quantum computers that can be simulated classically in polyn...
Sort
View
ASM
2005
ASM
14 years 1 months ago
RAM Simulation of BGS Model of Abstract State Machines
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...
Seshadhri Comandur, Anil Seth, Somenath Biswas
ICTAI
1994
IEEE
13 years 12 months ago
NSK, an Object-Oriented Simulator Kernel for Arbitrary Feedforward Neural Networks
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...
Cédric Gégout, Bernard Girau, Fabric...
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
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 ...
Guillaume Burel
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 10 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
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...
Stefan Kratsch, Magnus Wahlström
TC
2008
13 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
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 ...
Francisco Rodríguez-Henríquez, Guill...