Leonard Adleman
- NP-Complete decision problems for binary quadratics
1978/04/01 by Kenneth L. Manders, Leonard M. Adleman, Leonard Adleman · 1 citation
Computer Science · Mathematics · #Algorithm #Combinatorics #Complexity class #Computability, Logic, AI Algorithms #Computational complexity theory #Decision problem #Degree (music) #Discrete mathematics #Logic, programming, and type systems #Mathematics #Modulo #NP #Natural number #Nondeterministic algorithm #P versus NP problem #PSPACE #Time complexity #Turing machine #Variable (mathematics) #semigroups and automata theory