6 papers
Solving Restricted Versions of #SAT Faster than : Algorithms and Lower Bounds
Sanjay Jain, Junqiang Peng, Frank Stephan +1
Under the Strong Exponential Time Hypothesis (SETH), for any constant , the #SAT problem (counting the number of satisfying assignments of a CNF formula) cannot be…
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…
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…
An Improved Algorithm for Sparse Instances of SAT
Sanjay Jain, Tzeh Yuan Neoh, Frank Stephan
We show that the CNF satisfiability problem (SAT) can be solved in time , where is either the maximum number of occurrences of any variable or the average…
Classifying different criteria for learning algebraic structures
Nikolay Bazhenov, Vittorio Cipriani, Sanjay Jain +2
In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a lear…
Languages given by Finite Automata over the Unary Alphabet
Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz +5
This paper studies the complexity of operations on finite automata and the complexity of their decision problems when the alphabet is unary. Let denote the maximum of the numbe…