SearcharxivSearch

arXiv subjects

Peiyush Jain

Publications and source records attributed to Peiyush Jain.

2 recordsLinked to original sources

On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem

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 NP-Completeness results for problems on $k$-colourable graphs ($k \ge 5$). We also prove the NP-Completeness of the Triangle-Free Cut problem.

cs.CC

A Simple In-Place Algorithm for In-Shuffle

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.

cs.DS