1383 search results - page 40 / 277 » On the Complexity of the Interlace Polynomial |
CORR
2004
Springer
14 years 10 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
IANDC
1998
14 years 9 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
ECCC
2006
14 years 10 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
EOR
2008
14 years 10 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...