484 search results - page 63 / 97 » Computing Hilbert Class Polynomials |
JCT
2008
13 years 8 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
ESOP
2012
Springer
12 years 4 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
STOC
1993
ACM
14 years 24 days ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...