16843 search results - page 215 / 3369 » On Generalized Authorization Problems |
164
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
138
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
165
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
132
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
182
click to vote
AAAI
2006
15 years 7 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...