


default search action
Chicago Journal of Theoretical Computer Science, Volume 2020
Volume 2020, 2020
- Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower bounds for linear decision lists. - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. - Dmitry Gavinsky:
The communication complexity of the inevitable intersection problem. - Rohit Agrawal:
Coin Theorems and the Fourier Expansion.

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.