494 search results - page 2 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
JOC
2007
13 years 7 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...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
TCS
2010
13 years 6 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
CVIU
2011
12 years 11 months ago
2011
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...