"On the limits of the communication complexity technique for proving lower ..."

Juraj Hromkovic, Holger Petersen, Georg Schnitger (2009)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2009.03.020

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/HromkovicPS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HromkovicPS09
Juraj Hromkovic, Holger Petersen, Georg Schnitger:
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. Theor. Comput. Sci. 410(30-32): 2972-2981 (2009)

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.