Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (Q4521124)
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: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory |
scientific article; zbMATH DE number 1545073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory |
scientific article; zbMATH DE number 1545073 |
Statements
16 July 2001
0 references
promise classes
0 references
NP-hard
0 references
counting property of circuits
0 references
UP-hard
0 references
polynomial-time Turing reductions
0 references
generators
0 references
Rice's theorem
0 references
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (English)
0 references
