Get started
Author

Vaibhav Krishan

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates
2022 · Swapnam Bajpai, Vaibhav Krishan, et al. · Algorithmica · 5
PDF
Upper Bound for Torus Polynomials
2021 · Vaibhav Krishan · Lecture notes in computer science · 3
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates
2019 · Bajpai, Swapnam, Krishan, Vaibhav, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2
PDF
On $CC^0$ Lower Bounds for AND via Torus Polynomials
2026 · Krishan, Vaibhav, Sarma, Jayalal · arXiv (Cornell University) · 1
PDF
Lower Bounds and Separations for Torus Polynomials
2026 · Krishan, Vaibhav, Vishwanathan, Sundar · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 1
PDF
On Proof Systems for #QBF
2026 · Chede, Sravanthi, Chew, Leroy, et al. · arXiv (Cornell University) · 1
PDF
MAGIKC: A Quantified MaxSAT Solver
2026 · Chede, Sravanthi, Krishan, Vaibhav, et al. · Zenodo (CERN European Organization for Nuclear Research)
On Knowledge Compilation Languages for QBFs
2026 · Chede, Sravanthi, Krishan, Vaibhav, et al. · arXiv (Cornell University)
PDF
TQTSolver
2026 · Chede, Sravanthi, Krishan, Vaibhav, et al. · Zenodo (CERN European Organization for Nuclear Research)
Degree Lower Bounds for Torus Polynomials and $MAJORITY$ vs $ACC^0$
2026 · Krishan, Vaibhav, Vishwanathan, Sundar · arXiv (Cornell University)
PDF
On CC⁰ Lower Bounds for AND via Torus Polynomials
2026 · Krishan, Vaibhav, Sarma, Jayalal · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Isolation Lemma for Directed Reachability and NL vs. L.
2016 · Vaibhav Krishan, Nutan Limaye · Electronic colloquium on computational complexity
Works count: 12
Citation count: 13
H-index: 2
I10-index:
Year
Topic
Type