Follow
Nikhil Balaji
Title
Cited by
Cited by
Year
On the complexity of value iteration
N Balaji, S Kiefer, P Novotný, GA Pérez, M Shirmohammadi
arXiv preprint arXiv:1807.04920, 2018
212018
Low-depth uniform threshold circuits and the bit-complexity of straight line programs
E Allender, N Balaji, S Datta
Mathematical Foundations of Computer Science 2014: 39th International …, 2014
192014
Complexity of restricted variants of Skolem and related problems
S Akshay, N Balaji, N Vyas
LIPIcs 78, 2017
132017
Near-optimal complexity bounds for fragments of the Skolem problem
S Akshay, N Balaji, A Murhekar, R Varma, N Vyas
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
102020
Cryptanalysis of a chaotic image encryption algorithm
N Balaji, N Nagaraj
arXiv preprint arXiv:0801.0276, 2008
102008
An almost cubic lower bound for ΣΠΣ circuits computing a polynomial in VP
N Balaji, N Limaye, S Srinivasan
Electronic Colloquium on Computational Complexity (ECCC) 23 (143), 3, 2016
82016
Counting Euler tours in undirected bounded treewidth graphs
N Balaji, S Datta, V Ganesan
arXiv preprint arXiv:1510.04035, 2015
72015
Bounded treewidth and space-efficient linear algebra
N Balaji, S Datta
International Conference on Theory and Applications of Models of Computation …, 2015
7*2015
Graph properties in node-query setting: effect of breaking symmetry
N Balaji, S Datta, R Kulkarni, S Podder
arXiv preprint arXiv:1510.08267, 2015
52015
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs 1
E Allender, N Balaji, S Datta, R Pratap
Computability 12 (2), 145-173, 2023
32023
Cyclotomic identity testing and applications
N Balaji, S Perifel, M Shirmohammadi, J Worrell
Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021
32021
Identity testing for radical expressions
N Balaji, K Nosan, M Shirmohammadi, J Worrell
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
22022
Skew circuits of small width
N Balaji, A Krebs, N Limaye
Theoretical Computer Science 821, 111-123, 2020
22020
USSR is in P/poly
N Balaji, S Datta
2024 Symposium on Simplicity in Algorithms (SOSA), 151-159, 2024
12024
Multiplicity Problems on Algebraic Series and Context-Free Grammars
N Balaji, L Clemente, K Nosan, M Shirmohammadi, J Worrell
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2023
12023
Terms of Lucas sequences having a large smooth divisor
N Balaji, F Luca
Canadian Mathematical Bulletin 66 (1), 225-231, 2023
12023
35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
MS Charikar, A Bouajjani, M Emmi, C Enea, J Hamza, J Worrell, B Barak, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015
12015
Succinct Numbers, Skew Circuits and Bounded Treewidth Graphs: Algorithms and Complexity
N Balaji
Chennai Mathematical Institute, 2016
2016
Collapsing exact arithmetic hierarchies
N Balaji, S Datta
International Workshop on Algorithms and Computation, 273-285, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–19