Efficient monotone circuits for threshold functions (Q1122560): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90011-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004365288 / rank
 
Normal rank
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
    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

    Identifiers