Nikhil Balaji

From MaRDI portal
Person:2173306

Available identifiers

zbMath Open balaji.nikhilMaRDI QIDQ2173306

List of research outcomes





PublicationDate of PublicationType
Cyclotomic identity testing and applications2025-01-20Paper
Identity testing for radical expressions2024-12-06Paper
USSR is in P/poly2024-05-29Paper
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs12023-09-13Paper
Terms of Lucas sequences having a large smooth divisor2023-03-17Paper
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem2023-02-07Paper
On the Complexity of Value Iteration2022-07-21Paper
Complexity of Restricted Variants of Skolem and Related Problems2020-05-26Paper
Skew circuits of small width2020-04-22Paper
Graph properties in node-query setting: effect of breaking symmetry2018-03-21Paper
Counting Euler Tours in Undirected Bounded Treewidth Graphs2017-07-13Paper
Skew Circuits of Small Width2015-10-29Paper
Bounded Treewidth and Space-Efficient Linear Algebra2015-09-30Paper
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs2014-10-14Paper
Collapsing exact arithmetic hierarchies2014-02-18Paper
Tree-width and Logspace: Determinants and Counting Euler Tours2013-12-28Paper

Research outcomes over time

This page was built for person: Nikhil Balaji

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2173306&oldid=6880479"
Powered by MediaWiki