Pages that link to "Item:Q3359758"
From MaRDI portal
The following pages link to PP is as Hard as the Polynomial-Time Hierarchy (Q3359758):
Displaying 33 items.
- (Q5141616) (← links)
- (Q5155685) (← links)
- On the parameterized complexity of approximate counting (Q5198932) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS (Q5404514) (← links)
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)
- ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES (Q5704373) (← links)
- Percentile queries in multi-dimensional Markov decision processes (Q5892424) (← links)
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (Q5892607) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
- Hyper-polynomial hierarchies and the polynomial jump (Q5958122) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q6162056) (← links)
- Stochastic decision Petri nets (Q6535196) (← links)
- Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)
- Towards logical foundations for probabilistic computation (Q6560995) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)
- Complexity barriers as independence (Q6599290) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- On the power of counting the total number of computation paths of NPTMs (Q6636085) (← links)
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy (Q6642430) (← links)
- Reasoning on data words over numeric domains (Q6649469) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
