18 citations · 68 across the 27 of their papers we have counts for
4 papers · 1 filter
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms
Tuhin Sahai, Anurag Mishra, Jose Miguel Pasini +1
Given a Boolean formula in conjunctive normal form (CNF), the density of states counts the number of variable assignments that violate exactly clauses, for all values of…
Continuous Relaxations for the Traveling Salesman Problem
Tuhin Sahai, Adrian Ziessler, Stefan Klus +1
In this work, we aim to explore connections between dynamical systems techniques and combinatorial optimization problems. In particular, we construct heuristic approaches for the t…
A Spectral Assignment Approach for the Graph Isomorphism Problem
Stefan Klus, Tuhin Sahai
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graph…
Hearing the clusters in a graph: A distributed algorithm
Tuhin Sahai, Alberto Speranzon, Andrzej Banaszuk
We propose a novel distributed algorithm to cluster graphs. The algorithm recovers the solution obtained from spectral clustering without the need for expensive eigenvalue/vector c…