"Lower Bounds for Unambiguous Automata via Communication Complexity."

Mika Göös, Stefan Kiefer, Weiqiang Yuan (2022)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-03-30

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/GoosKY22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GoosKY22
Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. Electron. Colloquium Comput. Complex. TR22 (2022)

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.