On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (Q3002779)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy |
scientific article |
Statements
24 May 2011
0 references
satisfiability
0 references
polynomial-time hierarchy
0 references
expander graphs
0 references
superconcentrator graphs
0 references
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (English)
0 references
