Efficient monotone circuits for threshold functions (Q1122560): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sorting in \(c \log n\) parallel steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5730446 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shifting Graphs and Their Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Improved Lower Bound for Sorting Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762226 / rank | |||
Normal rank |
Latest revision as of 08:25, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient monotone circuits for threshold functions |
scientific article |
Statements
Efficient monotone circuits for threshold functions (English)
0 references
1989
0 references
circuit complexity
0 references
Boolean function
0 references
sorting network
0 references
monotone circuit
0 references
threshold function
0 references