"The Linear-Array Conjecture in Communication Complexity Is False."

Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky (1999)

> Home

Details and statistics

DOI: 10.1007/S004930050054

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/KushilevitzL99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/KushilevitzL99
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity Is False. Comb. 19(2): 241-254 (1999)

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.