"3-Party Message Complexity is Better than 2-Party Ones for Proving Lower ..."

Henry N. Adorna (2002)

> Home

Details and statistics

DOI: 10.25596/JALC-2002-419

access: closed

type: Journal Article

metadata version: 2020-05-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jalc/Adorna02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jalc/Adorna02
Henry N. Adorna:
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. J. Autom. Lang. Comb. 7(4): 419-432 (2002)

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.