"Lower Bounds for the Majority Communication Complexity of Various Graph ..."

Christoph Meinel, Stephan Waack (1996)

> Home

Details and statistics

DOI: 10.1007/BF01301969

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/MeinelW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/MeinelW96
Christoph Meinel, Stephan Waack:
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Math. Syst. Theory 29(6): 649-659 (1996)

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.