3 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.CC2026
Strictly Unfriendly -Partitions: Sharp Degree Thresholds and ETH-Based Lower Bounds
Sanjay Jain, Frank Stephan, Haoyun Tang
We present a complete complexity classification and fine-grained analysis for the Strictly Unfriendly -Partition problem (), which asks whether the vertices…
cs.DS2026
New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
Sanjay Jain, Junqiang Peng, Frank Stephan +2
Parity-SAT is the problem of determining whether a given CNF formula has an odd number of satisfying assignments. As a canonical P-complete problem, it represents a fundame…
gr-qc2018★ 3 cited
Entropy of Vaidya Black Hole on Apparent Horizon with Minimal length Revisited
Hao Tang, Bin Wu, Cheng-yi Sun +2
By considering the generalized uncertainty principle, the degrees of freedom near the apparent horizon of Vaidya black hole are calculated with thin film model. The result shows th…