ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: A super-polynomial lower bound for regular arithmetic formulas
Article URLs:
Alternative Article URLs:
Authors: Neeraj Kayal
  • Indian Institute of Science Bangalore, India
Chandan Saha
  • Indian Institute of Science Bangalore, India
Ramprasad Saptharishi
  • Microsoft Research India Bangalore, India
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/KayalSS14
Author Comments:

Discuss this paper and its artifacts below