Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (Q4521124): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory | |||
| Property / author | |||
| Property / author: Bernd Borchert / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Frank Stephan / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4<489::aid-malq489>3.0.co;2-f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024071675 / rank | |||
Normal rank | |||
| Property / title | |||
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (English) | |||
| Property / title: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (English) / rank | |||
Normal rank | |||
Latest revision as of 10:12, 30 July 2024
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
