Pages that link to "Item:Q4727430"

The following pages link to Complete sets and closeness to complexity classes (Q4727430):

Displaying 25 items.

• The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
• The fault tolerance of NP-hard problems (Q553311) (← links)
• Reducibility classes of P-selective sets (Q672155) (← links)
• A note on P-selective sets and closeness (Q673619) (← links)
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
• A hierarchy for closed \(n\)-cell complements (Q680332) (← links)
• Frequency of correctness versus average polynomial time (Q989533) (← links)
• Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
• Notes on polynomial levelability (Q1119389) (← links)
• On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
• Exponential-time and subexponential-time sets (Q1261474) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• The opacity of backbones (Q2051797) (← links)
• Robustness of PSPACE-complete sets (Q2379952) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Completeness in approximation classes beyond APX (Q2503307) (← links)
• Bounds on Quasi-Completeness (Q2876551) (← links)
• On intractability of the classUP (Q3201755) (← links)
• Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← links)
• The Fault Tolerance of NP-Hard Problems (Q3618596) (← links)
• On lower bounds of the closeness between complexity classes (Q4032931) (← links)
• Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
• (Q4818139) (← links)
• A refinement of the low and high hierarchies (Q4841766) (← links)
• Complexity properties of recursively enumerable sets and \(bsQ\)-completeness (Q5942014) (← links)