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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8683604001998901
0 references
0.8681376576423645
0 references
0.7724713683128357
0 references
0.7698214650154114
0 references
0.7635663747787476
0 references
