"Communication Complexity Method for Proving Lower Bounds on Descriptional ..."

Juraj Hromkovic, Georg Schnitger (2005)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2011-10-21

- no documents available
- export record
  dblp key:
  - conf/dcfs/HromkovicS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/HromkovicS05
Juraj Hromkovic, Georg Schnitger:
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38

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.