The following pages link to Computing and Combinatorics (Q5716924):
Displaying 11 items.
- Some observations on holographic algorithms (Q1616615) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- Problem of checking the functional completeness in the class of piecewise parallel functions (Q2513031) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- Problems complete for \(\oplus L\) (Q3979264) (← links)
- (Q5090992) (← links)
- (Q5111865) (← links)
- Understanding PPA-completeness (Q5368757) (← links)