"The query complexity of graph isomorphism: bypassing distribution testing ..."

Krzysztof Onak, Xiaorui Sun (2018)

> Home

Details and statistics

DOI: 10.1145/3188745.3188952

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/OnakS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/OnakS18
Krzysztof Onak, Xiaorui Sun:
The query complexity of graph isomorphism: bypassing distribution testing lower bounds. STOC 2018: 165-171

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.