The following pages link to (Q3696516):
Displaying 13 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- On the complexity of ranking (Q920620) (← links)
- A note on complete problems for complexity classes (Q1097029) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- On strong NP-completeness of rational problems (Q1625182) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP (Q5055954) (← links)
- (Q5687692) (← links)
- On Unapproximable Versions of $NP$-Complete Problems (Q5691296) (← links)
- On Some $\mathcal{NP}$ -complete SEFE Problems (Q5746258) (← links)
