The following pages link to (Q3059320):
Displaying 12 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- Product-state approximations to quantum states (Q5962905) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
