"On the Complexity of Planar Boolean Circuits."

György Turán (1995)

> Home

Details and statistics

DOI: 10.1007/BF01277954

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/Turan95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/Turan95
György Turán:
On the Complexity of Planar Boolean Circuits. Comput. Complex. 5(1): 24-42 (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.