1379 search results - page 145 / 276 » The Complexity of the Annihilating Polynomial |
222
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
175
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
162
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
165
click to vote
CSL
2005
Springer
15 years 12 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
188
click to vote
KI
2007
Springer
16 years 18 days ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...