"A Lower Bound on the Complexity of Arbitrary Switching Function Realizers."

William E. Hansalik (1972)

> Home

Details and statistics

DOI: 10.1109/T-C.1972.223552

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  authority control:
- export record
  dblp key:
  - journals/tc/Hansalik72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/Hansalik72
William E. Hansalik:
A Lower Bound on the Complexity of Arbitrary Switching Function Realizers. IEEE Trans. Computers 21(5): 507-510 (1972)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.