The strongest model of computation obeying 0-1 Principles (Q633766): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Dedekind's Problem: The Number of Monotone Boolean Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4349924 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: K-way bitonic sort / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The asymptotic complexity of merging networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385519 / rank | |||
Normal rank | |||
Latest revision as of 21:48, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strongest model of computation obeying 0-1 Principles |
scientific article |
Statements
The strongest model of computation obeying 0-1 Principles (English)
0 references
30 March 2011
0 references
zero-one principle
0 references
comparator networks
0 references
sorting networks
0 references
min max networks
0 references
oblivious algorithms
0 references
