Nikhil Balaji

Available identifiers

zbMath Open balaji.nikhilMaRDI QIDQ2173306

List of research outcomes

Publication	Date of Publication	Type
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1	2023-09-13	Paper
Terms of Lucas sequences having a large smooth divisor	2023-03-17	Paper
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem	2023-02-07	Paper
On the Complexity of Value Iteration	2022-07-21	Paper
Complexity of Restricted Variants of Skolem and Related Problems	2020-05-26	Paper
Skew circuits of small width	2020-04-22	Paper
Graph properties in node-query setting: effect of breaking symmetry	2018-03-21	Paper
Counting Euler Tours in Undirected Bounded Treewidth Graphs	2017-07-13	Paper
Skew Circuits of Small Width	2015-10-29	Paper
Bounded Treewidth and Space-Efficient Linear Algebra	2015-09-30	Paper
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs	2014-10-14	Paper
Collapsing Exact Arithmetic Hierarchies	2014-02-18	Paper
Tree-width and Logspace: Determinants and Counting Euler Tours	2013-12-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nikhil Balaji