vix.ing · top · new · best · stats · spec

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

paper · doi:10.1016/0022-0000(78)90044-2

crossref issued 1978/04/01 · crossref published 1978/04/01 · crossref published-print 1978/04/01 · openalex publication_date 1978/04/01 · crossref created 2003/12/04 · crossref deposited 2019/02/16 · openalex created_date 2025/10/10 · crossref indexed 2026/02/05 · openalex updated_date 2026/07/23

Citations

Cited by