default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVikraman Arvind
- > Home > Persons > Vikraman Arvind
Publications
- 2024
[c92]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. ICALP 2024: 14:1-14:19- [i94]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. CoRR abs/2404.16382 (2024) - [i91]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c88]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. MFCS 2023: 14:1-14:15 - [i90]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. CoRR abs/2303.06001 (2023) - [i83]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c86]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CCC 2022: 12:1-12:22 - [i80]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CoRR abs/2202.09883 (2022) - [i79]Vikraman Arvind, Pushkar S. Joglekar:
Matrix Polynomial Factorization via Higman Linearization. CoRR abs/2203.16978 (2022) - [i75]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - [i74]Vikraman Arvind, Pushkar S. Joglekar:
Matrix Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - 2019
- [j56]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15: 1-36 (2019) - 2018
- [j54]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
:
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262: 22-39 (2018) - 2017
- [c72]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized polynomial time identity testing for noncommutative circuits. STOC 2017: 831-841 - 2016
- [j45]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. ACM Trans. Comput. Theory 9(1): 3:1-3:29 (2016) - [i55]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR abs/1611.07235 (2016) - [i54]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c68]Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar:
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) 2015: 38-49 - [i51]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. CoRR abs/1501.00671 (2015) - [i49]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. CoRR abs/1508.00395 (2015) - [i47]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. TR15 (2015) - [i46]Vikraman Arvind, Pushkar S. Joglekar, Raja S:
Noncommutative Valiant's Classes: Structure and Complete Problems. Electron. Colloquium Comput. Complex. TR15 (2015) - 2009
- [c51]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
Arithmetic Circuits and the Hadamard Product of Polynomials. FSTTCS 2009: 25-36 - [c50]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. ISAAC 2009: 637-646 - [c49]Vikraman Arvind, Pushkar S. Joglekar:
Arithmetic Circuits, Monomial Algebras and Finite Automata. MFCS 2009: 78-89 - [i31]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. CoRR abs/0907.3780 (2009) - [i30]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
Arithmetic Circuits and the Hadamard Product of Polynomials. CoRR abs/0907.4006 (2009) - [i25]Vikraman Arvind, Pushkar S. Joglekar:
Arithmetic Circuit Size, Identity Testing, and Finite Automata. Electron. Colloquium Comput. Complex. TR09 (2009) - [i24]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c43]Vikraman Arvind, Pushkar S. Joglekar:
Some Sieving Algorithms for Lattice Problems. FSTTCS 2008: 25-36 - [c42]Vikraman Arvind, Pushkar S. Joglekar:
Algorithmic Problems for Metrics on Permutation Groups. SOFSEM 2008: 136-147 - [i18]Vikraman Arvind, Pushkar S. Joglekar:
Lattice Problems, Gauge Functions and Parameterized Algorithms. CoRR abs/0804.4744 (2008)
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
