On the complexity of branching programs and decision trees for clique functions (Q3798243): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56210449, #quickstatements; #temporary_batch_1711565664090 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/42282.46161 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162199822 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56210449 / rank | |||
Normal rank | |||
Latest revision as of 21:26, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of branching programs and decision trees for clique functions |
scientific article |
Statements
On the complexity of branching programs and decision trees for clique functions (English)
0 references
1988
0 references
complexity hierarchies
0 references
clique functions
0 references
Boolean decision-tree
0 references
branching programs
0 references
polynomial lower bounds
0 references
sequences of Boolean functions
0 references
