14.2k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Pennsylvania State UniversityUS156 papers
- Tata Institute of Fundamental ResearchIN156 papers
- Cardiff UniversityGB146 papers
- Centre National de la Recherche ScientifiqueFR144 papers
- Max Planck Institute for Gravitational PhysicsDE143 papers
- California Institute of TechnologyUS136 papers
- Inter-University Centre for Astronomy and AstrophysicsIN134 papers
- Leibniz University HannoverDE133 papers
- Montclair State UniversityUS133 papers
- University of BirminghamGB133 papers
- University of MississippiUS133 papers
- University of FloridaUS131 papers
3 papers · 2 filters
Constructive noncommutative rank computation is in deterministic polynomial time
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm…
Some Lower Bound Results for Set-Multilinear Arithmetic Computations
V. Arvind, S. Raja
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natu…
On Fortification of Projection Games
Amey Bhangale, Ramprasad Saptharishi, Girish Varma +1
A recent result of Moshkovitz \cite{Moshkovitz14} presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection g…