"Modelling the complexity of parallel and VLSI computations with Boolean ..."

Constantinos V. Papadopoulos, Theodoros Andronikos (1995)

> Home

Details and statistics

DOI: 10.1016/0141-9331(95)93087-Y

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mam/PapadopoulosA95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mam/PapadopoulosA95
Constantinos V. Papadopoulos, Theodoros Andronikos:
Modelling the complexity of parallel and VLSI computations with Boolean circuits. Microprocess. Microsystems 19(1): 43-50 (1995)

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.