44 search results - page 4 / 9 » acmse 2006 |
ACMSE
2006
ACM
14 years 1 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ACMSE
2006
ACM
14 years 1 days 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...
ACMSE
2006
ACM
13 years 9 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
ACMSE
2006
ACM
14 years 1 days ago
2006
ACM
SQL injection attacks potentially affect all applications, especially web applications, that utilize a database backend. While these attacks are generally against the application...
ACMSE
2006
ACM
14 years 1 days ago
2006
ACM
Software is increasingly pervasive in the products we use. Consequently, more programmers are needed to develop the software, and consequently there is unmet demand on programming...