Comparator circuits over finite bounded posets (Q1640992): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Merged Item from Q3448841 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the comparator circuit value problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692885 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of circuit value and network stability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every finite lattice can be embedded in a finite partition lattice / rank | |||
Normal rank | |||
Revision as of 22:48, 10 July 2024
scientific article; zbMATH DE number 6498695
- Comparator Circuits over Finite Bounded Posets
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparator circuits over finite bounded posets |
scientific article; zbMATH DE number 6498695 |
|
Statements
Comparator circuits over finite bounded posets (English)
0 references
Comparator Circuits over Finite Bounded Posets (English)
0 references
14 June 2018
0 references
27 October 2015
0 references
comparator circuits
0 references
logspace computation
0 references
polynomial-size circuits
0 references
