Average time of computing Boolean operators (Q4242300): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Average case complexity for finite Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5333608 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00293-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021828019 / rank | |||
Normal rank | |||
Latest revision as of 11:05, 30 July 2024
scientific article; zbMATH DE number 1285547
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average time of computing Boolean operators |
scientific article; zbMATH DE number 1285547 |
Statements
Average time of computing Boolean operators (English)
0 references
10 May 1999
0 references
non-branching program
0 references
straight-line program
0 references
complexity
0 references
Shannon's function
0 references
Boolean function
0 references
