1717 search results - page 134 / 344 » A Computable Spectral Theorem |
EUSFLAT
2007
15 years 6 months ago
2007
The paper presents an overview of a computation friendly calculus of fuzzy relations. It is presented within the framework of an enriched generic algebra of relations that we have...
143
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
122
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
124
Voted
BSL
2006
15 years 4 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
130
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...