Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. |
scientific article; zbMATH DE number 7204360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. |
scientific article; zbMATH DE number 7204360 |
Statements
26 May 2020
0 references
Tseitin formula
0 references
read-once branching program
0 references
expander
0 references
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (English)
0 references
