Coding runs of Turing machines, NP-completeness and related topics
Year: 2009
Type: book-chapter
Parent work: Introduction to Mathematics of Satisfiability
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2502927933
