Nikhil Balaji

About

Primarily interested in Computational Complexity, Automata Theory, Verification and their interplay.

Employment

Employment history is unavailable.

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (15)

• USSR is in P/poly
  2024 Symposium on Simplicity in Algorithms (SOSA) 2024 1 citation DOI: 10.1137/1.9781611977936.15
  +Save
• Multiplicity Problems on Algebraic Series and Context-Free Grammars
  2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2023 1 citation DOI: 10.1109/lics56636.2023.10175707
  +Save
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
  Computability 2023 2 citations DOI: 10.3233/com-220407
  +Save
• Identity Testing for Radical Expressions
  Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science 2022 3 citations DOI: 10.1145/3531130.3533331
  +Save
• Terms of Lucas sequences having a large smooth divisor
  Canadian Mathematical Bulletin 2022 0 citations DOI: 10.4153/s0008439522000248
  +Save
• Cyclotomic Identity Testing and Applications
  Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation 2021 2 citations DOI: 10.1145/3452143.3465530
  +Save
• Near-optimal complexity bounds for fragments of the skolem problem
  Leibniz International Proceedings in Informatics, LIPIcs 2020 5 citations DOI: 10.4230/LIPIcs.STACS.2020.37
  +Save
• Skew circuits of small width
  Theoretical Computer Science 2020 0 citations DOI: 10.1016/j.tcs.2017.03.013
  +Save
• On the complexity of value iteration
  Leibniz International Proceedings in Informatics, LIPIcs 2019 0 citations DOI: 10.4230/LIPIcs.ICALP.2019.102
  +Save
• Complexity of restricted variants of skolem and related problems
  Leibniz International Proceedings in Informatics, LIPIcs 2017 7 citations DOI: 10.4230/LIPIcs.MFCS.2017.78
  +Save