"Universal trees grow inside separating automata: Quasi-polynomial lower ..."

Wojciech Czerwinski et al. (2019)

> Home

Details and statistics

DOI: 10.1137/1.9781611975482.142

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/CzerwinskiDFJLP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/CzerwinskiDFJLP19
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys:
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA 2019: 2333-2349

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.