default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnurag Pandey 0001
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Anurag Pandey 0002 — HCL Technologies Ltd., Noida, India
- Anurag Pandey 0003 — Amity University, School of Engineering & Technology, Noida, India
- Anurag Pandey 0004 — IIT Mandi, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica 85(9): 2554-2579 (2023)- 2022
- [c10]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ICALP 2022: 83:1-83:20 - [c9]Balagopal Komarath, Anurag Pandey, Nitin Saurabh:
Rabbits Approximate, Cows Compute Exactly! MFCS 2022: 65:1-65:14 - 2021
- [b1]Anurag Pandey:
Variety membership testing in algebraic complexity theory. Saarland University, Germany, 2021 - [c8]Pranjal Dutta
, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. CCC 2021: 25:1-25:36 - [c7]Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer:
On the Orbit Closure Containment Problem and Slice Rank of Tensors. SODA 2021: 2565-2584 - [i7]Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c6]Markus Bläser, Anurag Pandey:
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. APPROX-RANDOM 2020: 8:1-8:13 - [c5]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CCC 2020: 21:1-21:24 - [c4]Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
How many zeros of a random sparse polynomial are real? ISSAC 2020: 273-280 - [i6]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CoRR abs/2003.04834 (2020) - [i5]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Graph Homomorphism Polynomials: Algorithms and Complexity. CoRR abs/2011.04778 (2020) - [i4]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c3]Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey:
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. SODA 2019: 647-661 - [i3]Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer:
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. CoRR abs/1911.02534 (2019) - [i2]Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
How many zeros of a random sparse polynomial are real? CoRR abs/1911.02540 (2019) - 2018
- [j2]Anurag Pandey, Nitin Saxena, Amit Sinhababu:
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. 27(4): 617-670 (2018) - [j1]Markus Bläser, Gorav Jindal, Anurag Pandey:
A Deterministic PTAS for the Commutative Rank of Matrix Spaces. Theory Comput. 14(1): 1-21 (2018) - 2017
- [c2]Markus Bläser, Gorav Jindal, Anurag Pandey:
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. CCC 2017: 33:1-33:16 - 2016
- [c1]Anurag Pandey, Nitin Saxena, Amit Sinhababu:
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. MFCS 2016: 74:1-74:15 - [i1]Markus Bläser, Gorav Jindal, Anurag Pandey:
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
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-26 23:41 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:
