"White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph ..."

Ilan Komargodski, Moni Naor, Eylon Yogev (2019)

> Home

Details and statistics

DOI: 10.1145/3341106

access: closed

type: Journal Article

metadata version: 2019-10-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/KomargodskiNY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KomargodskiNY19
Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66(5): 34:1-34:28 (2019)

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.