Pages that link to "Item:Q1190987"
From MaRDI portal
The following pages link to Turing machines with few accepting computations and low sets for PP (Q1190987):
Displaying 18 items.
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- Universally serializable computation (Q1384538) (← links)
- PP-lowness and a simple definition of AWPP (Q1405795) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- (Q3530393) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- UP and the low and high hierarchies: A relativized separation (Q4895813) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Graph isomorphism is low for PP (Q5096798) (← links)
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory (Q5126830) (← links)
- UP and the low and high hierarchies: A relativized separation (Q5204316) (← links)