3 papers
math.OC2025
A new method for reducing algebraic programs to polynomial programs
Muhammad Maaz, Adam W. Strzeboński
We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic function…
cs.GT2020
Saturating stable matchings
Muhammad Maaz
I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one sid…
cs.LG2019
Viability of machine learning to reduce workload in systematic review screenings in the health sciences: a working paper
Muhammad Maaz
Systematic reviews, which summarize and synthesize all the current research in a specific topic, are a crucial component to academia. They are especially important in the biomedica…