Tayfun Pay
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1
Research Timeline
2026
Additional properties of parity based bit-counting complexity classes and hierarchies
The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.
Highlighted terms show continued research focus across papers