Anurag Pandey

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Rabbits approximate, cows compute Exactly!	2024-08-06	Paper
Monotone arithmetic complexity of graph homomorphism polynomials	2024-06-24	Paper
scientific article; zbMATH DE number 7788490 (Why is no real title available?)	2024-01-15	Paper
scientific article; zbMATH DE number 7758310 (Why is no real title available?)	2023-10-31	Paper
Monotone arithmetic complexity of graph homomorphism polynomials Algorithmica	2023-09-27	Paper
scientific article; zbMATH DE number 7711607 (Why is no real title available?)	2023-07-12	Paper
scientific article; zbMATH DE number 7561749 (Why is no real title available?) (available as arXiv preprint)	2022-07-21	Paper
How many zeros of a random sparse polynomial are real? Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation	2021-01-22	Paper
scientific article; zbMATH DE number 7204284 (Why is no real title available?)	2020-05-26	Paper
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory	2019-11-06	Paper
A deterministic PTAS for the algebraic rank of bounded degree polynomials Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits Computational Complexity	2018-12-10	Paper
A deterministic PTAS for the commutative rank of matrix spaces Theory of Computing	2018-06-15	Paper
Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits	2018-03-21	Paper

Research outcomes over time

This page was built for person: Anurag Pandey