"Towards a Reverse Newman's Theorem in Interactive Information Complexity."

Joshua Brody et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S00453-015-0112-9

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BrodyBKLSV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BrodyBKLSV16
Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76(3): 749-781 (2016)

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.