1092 search results - page 8 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
101
click to vote
SAS
2005
Springer
15 years 5 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
103
Voted
CSR
2009
Springer
15 years 6 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
109
click to vote
COCO
2001
Springer
15 years 4 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
93
Voted
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...