Q66547737

Summary

Q66547737 is a scholarly chapter^[1].

Key Facts

• Q66547737 authored Gregory S. Tseytin^[2].
• Q66547737's instance of is recorded as scholarly chapter^[3].
• Q66547737 is part of Q66549227^[4].
• Q66547737 was published on +1970-00-00T00:00:00Z^[5].
• Q66547737's main subject is boolean satisfiability problem^[6].
• Q66547737's main subject is propositional calculus^[7].
• Q66547737's main subject is conjunctive normal form^[8].
• Q66547737's main subject is Tseytin transformation^[9].
• Q66547737's work available at URL is recorded as http://www.decision-procedures.org/handouts/Tseitin70.pdf^[10].
• Q66547737's described at URL is recorded as https://link.springer.com/chapter/10.1007/978-3-642-81955-1_28^[11].
• Q66547737's published in is recorded as Q66549227^[12].
• Q66547737's title is recorded as On the complexity of derivation in propositional calculus^[13].
• Q66547737's URL is recorded as http://www.decision-procedures.org/handouts/Tseitin70.pdf^[14].

Body

Definition and Type

Q66547737's instance of is recorded as scholarly chapter^[3].

Use and Application

Q66547737 is part of Q66549227^[4].