494 search results - page 3 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
IJAC
2007
13 years 7 months ago
2007
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
MST
2011
12 years 10 months ago
2011
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 pol...