Pages that link to "Item:Q4302854"
From MaRDI portal
The following pages link to Complexity classes defined by counting quantifiers (Q4302854):
Displayed 22 items.
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Universally serializable computation (Q1384538) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- The ultra-weak Ash conjecture and some particular cases (Q3376535) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
- Dot operators (Q5958134) (← links)