Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296)
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: Satisfiability algorithm for syntactic read-\(k\)-times branching programs |
scientific article; zbMATH DE number 7357730
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability algorithm for syntactic read-\(k\)-times branching programs |
scientific article; zbMATH DE number 7357730 |
Statements
Satisfiability algorithm for syntactic read-\(k\)-times branching programs (English)
0 references
11 June 2021
0 references
branching program
0 references
read-\(k\)-times
0 references
satisfiability
0 references
moderately exponential time
0 references
polynomial space
0 references
0 references
0 references
