400 search results - page 2 / 80 » Hard Problem Generation for MKP |
ALGORITHMICA
2004
13 years 5 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
AIPS
2007
13 years 7 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
STACS
2009
Springer
14 years 1 days ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
AINA
2003
IEEE
13 years 9 months ago
2003
IEEE
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....