The following pages link to (Q4162483):
Displaying 6 items.
- New NP-hard and NP-complete polynomial and integer divisibility problems (Q1062447) (← links)
- Data science applications to string theory (Q2187812) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- Many bounded versions of undecidable problems are \textsf{NP}-hard (Q6594491) (← links)