"Lower Bounds for 2-Query LCCs over Large Alphabet."

Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX-RANDOM.2017.30

access: open

type: Conference or Workshop Paper

metadata version: 2019-02-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/BhattacharyyaGT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BhattacharyyaGT17
Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal:
Lower Bounds for 2-Query LCCs over Large Alphabet. APPROX-RANDOM 2017: 30:1-30:20

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.