ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: Separations in query complexity based on pointer functions
Article URLs:
Alternative Article URLs:
Authors: Andris Ambainis
  • University of Latvia, Faculty of Computing
Kaspars Balodis
  • University of Latvia, FC and IMCS
Aleksandrs Belovs
  • CWI
Troy Lee
  • NTU, SPMS
  • CQT
  • MajuLab
  • NUS
Miklos Santha
  • IRIF, CNRS
  • CQT, NUS
Juris Smotrovs
  • University of Latvia, Faculty of Computing
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/AmbainisBBLSS16
Author Comments:

Discuss this paper and its artifacts below