[go: up one dir, main page]

Follow
Weixun Deng
Title
Cited by
Cited by
Year
Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans
W Deng, A Ergur, G Paouris, JM Rojas
Proceedings of the 2024 International Symposium on Symbolic and Algebraic …, 2024
42024
Quickly computing isotopy type for exponential sums over circuits
F Bihan, E Croy, W Deng, K Phillipson, RJ Rennie, JM Rojas
ACM Communications in Computer Algebra 57 (3), 152-155, 2023
42023
Trinomials and deterministic complexity limits for real solving
E Boniface, W Deng, JM Rojas
arXiv preprint arXiv:2202.06115, 2022
32022
Viro's patchworking and the signed reduced A-discriminant
W Deng, JM Rojas, ML Telek
Journal of Symbolic Computation 132, 102462, 2026
22026
Optimal Bounds for the Number of Pieces of Near-Circuit Hypersurfaces
W Deng, JM Rojas, C Russell
arXiv preprint arXiv:2502.10590, 2025
22025
Optimal Bounds for the Number of Pieces of Real Near-Circuit Hypersurfaces
W Deng, JM Rojas, C Russell
Proceedings of the 2025 International Symposium on Symbolic and Algebraic …, 2025
2025
Feasibility of Circuit Polynomials without Black Swans
W Deng, A Ergür, G Paouris, JM Rojas
2024
SOLVING TRINOMIAL EQUATIONS OVER R IN POLYNOMIAL-TIME
E BONIFACE, W DENG, JM ROJAS
2021
The system can't perform the operation now. Try again later.
Articles 1–8