Pages that link to "Item:Q1241440"
From MaRDI portal
The following pages link to Complete sets and the polynomial-time hierarchy (Q1241440):
Displayed 50 items.
- Model-checking hierarchical structures (Q414908) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- On the complexity of kings (Q846367) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Properties of uniformly hard languages (Q1041777) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- A low and a high hierarchy within NP (Q1052097) (← links)
- On some natural complete operators (Q1064780) (← links)
- On bounded query machines (Q1085975) (← links)
- On \(\Delta ^ P_ 2\)-immunity (Q1087016) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- On hardness of one-way functions (Q1097693) (← links)
- On helping by robust oracle machines (Q1097695) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Optimization problems and the polynomial hierarchy (Q1152218) (← links)
- Bounded query machines: on NP( ) and NPQUERY( ) (Q1158752) (← links)
- A uniform approach to obtain diagonal sets in complexity classes (Q1164414) (← links)
- An arithmetical characterization of NP (Q1171050) (← links)
- On counting problems and the polynomial-time hierarchy (Q1171880) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Semigroup automaton structure by homomorphism and domain partition (Q1182316) (← links)
- Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
- Results on communication complexity classes (Q1190990) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets (Q1199689) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- A second step toward the polynomial hierarchy (Q1253656) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- Bounding queries in the analytic polynomial-time hierarchy (Q1274987) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- More on BPP and the polynomial-time hierarchy (Q1351599) (← links)
- Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)