Pages that link to "Item:Q1894445"
From MaRDI portal
The following pages link to On unique satisfiability and the threshold behavior of randomized reductions (Q1894445):
Displaying 10 items.
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Saving queries with randomness (Q1894455) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On unique satisfiablility and randomized reductions (Q3971264) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- On computing Boolean connectives of characteristic functions (Q4835862) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)