3 citations · 3 across the 3 of their papers we have counts for
3 papers
cond-mat.stat-mech2014
An alternate view of complexity in k-SAT problems
Supriya Krishnamurthy, Sumedha
The satisfiability threshold for constraint satisfaction problems is that value of the ratio of constraints (or clauses) to variables, above which the probability that a random ins…
cond-mat.stat-mech2012
Balanced K-SAT and Biased random K-SAT on trees
Sumedha, Supriya Krishnamurthy, Sharmistha Sahoo
We study and solve some variations of the random K-satisfiability problem - balanced K-SAT and biased random K-SAT - on a regular tree, using techniques we have developed earlier(a…
cond-mat.stat-mech2011★ 3 cited
On the behaviour of random K-SAT on trees
Supriya Krishnamurthy, Sumedha
We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solu…