Bounds to Complexities of Networks for Sorting and for Switching

Muller, David E.; Preparata, Franco P.

Permalink

https://hdl.handle.net/2142/74770 Copy

Description

Title

Bounds to Complexities of Networks for Sorting and for Switching

Author(s)

• Muller, David E.
• Preparata, Franco P.

Issue Date

1972-05

Keyword(s)

• Computational complexity
• Sorting
• Counting
• Symmetric Boolean functions
• Computation time
• Length of formula

Publisher

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG 72-2227, R-566

Type of Resource

text

Language

English

Permalink

http://hdl.handle.net/2142/74770

Sponsor(s)/Grant Number(s)

• Joint Services Electronics Program / DAAB-07-67-C-0199
• National Science Foundation / GP-23707

Owning Collections