The Design and Analysis of Algorithms

1992/01/01 by Dexter Kozen, Dexter C. Kozen · 6 citations
Computer Science · #Algorithm #Algorithms and Data Compression #Computability, Logic, AI Algorithms #Computer science #History of Computing Technologies

paper · doi:10.1007/978-1-4612-4400-4

crossref issued 1992/01/01 · crossref published 1992/01/01 · crossref published-print 1992/01/01 · openalex publication_date 1992/01/01 · crossref created 2012/07/28 · crossref deposited 2019/04/05 · openalex created_date 2025/10/10 · crossref indexed 2026/05/29 · openalex updated_date 2026/08/04

Cited by

• Infinitary Axiomatization of the Equational Theory of Context-Free Languages
• Counting models for 2SAT and 3SAT formulae
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
• Algorithms for Counting 2-Sat Solutions and Colorings with Applications
• Decision tree post-pruning without loss of accuracy using the SAT-PP algorithm with an empirical evaluation on clinical data
• Component (graph theory) [wikipedia]