2060 search results - page 49 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ENTCS
2008
14 years 9 months ago
2008
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...
ECAL
1995
Springer
15 years 1 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
COMBINATORICS
1999
14 years 9 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...