Pages that link to "Item:Q4727430"
From MaRDI portal
The following pages link to Complete sets and closeness to complexity classes (Q4727430):
Displayed 18 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)
- Frequency of correctness versus average polynomial time (Q989533) (← 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)
- On intractability of the classUP (Q3201755) (← 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)
- A refinement of the low and high hierarchies (Q4841766) (← links)