Výsledky vyhledávání - "68W01 General topics in the theory of algorithms"

On the optimality of pseudo-polynomial algorithms for integer programming Autor Fomin, Fedor V., Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket

“…In the classic Integer Programming Feasibility (IPF) problem, the objective is to decide whether, for a given m × n matrix A and an m -vector b = ( b 1 , ⋯ , b…”
Získat plný text