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

Henry N. Adorna (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2011-10-23

- no documents available
- export record
  dblp key:
  - conf/dcfs/Adorna01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/Adorna01
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. DCFS 2001: 23-34

a service of

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.