6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.CC2010★ 1 cited
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
Peiyush Jain
In this paper we define a restricted version of Monotone NAE-3SAT and show that it remains NP-Complete even under that restriction. We expect this result would be useful in proving…
cs.DS2008★ 6 cited
A Simple In-Place Algorithm for In-Shuffle
Peiyush Jain
The paper presents a simple, linear time, in-place algorithm for performing a 2-way in-shuffle which can be used with little modification for certain other k-way shuffles.