A complexity theory based on Boolean algebra (Q3771612): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q128705256, #quickstatements; #temporary_batch_1726319863356 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1145/3149.3158 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089857781 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128705256 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:33, 14 September 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complexity theory based on Boolean algebra |
scientific article |
Statements
A complexity theory based on Boolean algebra (English)
0 references
1985
0 references
circuit complexity
0 references
complexity classes
0 references
NP-completeness
0 references
Boolean function
0 references
projection
0 references
Turing-machine
0 references
complexity theory
0 references
