An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem

From MaRDI portal

(Redirected from An O(mn (nU)) time algorithm to solve the feasibility problem)
An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_%5C(O(mn_%5Clog_(nU))%5C)_time_algorithm_to_solve_the_feasibility_problem&oldid=63333597"