ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: A polynomial lower bound for testing monotonicity
Article URLs:
Alternative Article URLs:
Authors: Aleksandrs Belovs
  • Centrum Wiskunde and Informatica
Eric Blais
  • University of Waterloo, David R. Cheriton School of Computer Science
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/BelovsB16
Author Comments:

Discuss this paper and its artifacts below