3 papers
cs.DS2025
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
Giovanna K. Conrado, Amir K. Goharshady, Harshit J. Motwani +1
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) th…
eess.SY2025
On Certificates for Almost Sure Reachability in Stochastic Systems
Arash Bahari Kordabad, Rupak Majumdar, Harshit Jitendra Motwani +1
Almost sure reachability refers to the property of a stochastic system whereby, from any initial condition, the system state reaches a given target set with probability one. In thi…
cs.LO2024
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +3
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of…