"Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth."

Kristoffer Arnsfelt Hansen et al. (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-662-44465-8_29

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/HansenKSST14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/HansenKSST14
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347

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.