3 papers
cs.DM2025
CNFs and DNFs with Exactly Solutions
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weig…
cs.DS2024
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra +1
The focus of this paper is to increase our understanding of the Longest Processing Time First (LPT) heuristic. LPT is a classical heuristic for the fundamental problem of uniform m…
quant-ph2024
Krenn-Gu conjecture for sparse graphs
L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
Greenberger-Horne-Zeilinger (GHZ) states are quantum states involving at least three entangled particles. They are of fundamental interest in quantum information theory, and the co…