1995/11/01 by Gerd G Hillebrand, Gerd G. Hillebrand, Paris C. Kanellakis +5 · 1 citation
Computer Science · Mathematics · #Algorithm #Arity #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Datalog #Decidability #Discrete mathematics #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematics #Partition (number theory) #Predicate (mathematical logic) #Programming language #Turing machine #Undecidable problem
paper · pdf · doi:10.1016/0743-1066(95)00051-k
crossref issued 1995/11/01 · crossref published 1995/11/01 · crossref published-print 1995/11/01 · openalex publication_date 1995/11/01 · crossref created 2002/07/25 · crossref deposited 2019/04/29 · openalex created_date 2025/10/10 · crossref indexed 2025/10/10 · openalex updated_date 2026/08/01