494 search results - page 41 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
ACISP
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
ALT
2007
Springer
14 years 4 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...