Completeness and weak completeness under polynomial-size circuits (Q1917077)
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: Completeness and weak completeness under polynomial-size circuits |
scientific article; zbMATH DE number 896633
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness and weak completeness under polynomial-size circuits |
scientific article; zbMATH DE number 896633 |
Statements
Completeness and weak completeness under polynomial-size circuits (English)
0 references
2 January 1997
0 references
nonuniform complexity of problems
0 references
weakly P/Poly-Turing-complete problems
0 references
