283 search results - page 2 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
MST
2011
12 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...
JOC
2007
13 years 5 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
JUCS
2010
13 years 3 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...