494 search results - page 3 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
178
click to vote
PKC
2007
Springer
15 years 12 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...
163
click to vote
WADS
2009
Springer
16 years 10 days 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...
123
click to vote
IJAC
2007
15 years 5 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...
143
click to vote
SAS
2004
Springer
15 years 11 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...
271
click to vote
MST
2011
14 years 8 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...