4 papers
cs.CC2026
Even more properties of parity based bit-counting complexity classes
Tayfun Pay
We investigate several additional properties of parity based bit-counting complexity classes and . We first prove that ${\bf C_=P}={\bf…
cs.CC2026
Additional properties of parity based bit-counting complexity classes and hierarchies
Tayfun Pay
We study some properties of the parity based bit-counting complexity classes and . We first prove that both of these complexity class…
cs.CC2026
Bit-counting complexity classes
Tayfun Pay
We define bit-counting complexity classes whose membership depends on the binary profile of the number of accepting paths of non-deterministic polynomial time Turing machines. We s…
cs.CC2023
A Note On The Natural Range Of Unambiguous-SAT
Tayfun Pay
We discuss the natural range of the Unambiguous-SAT problem with respect to the number of clauses. We prove that for a given Boolean formula in precise conjunctive normal form with…