494 search results - page 1 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
94
Voted
CSR
2009
Springer
15 years 4 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...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We say an algorithm on n