We provide a new proof of the fact that Mathematical Programming is Turing-complete, and show how it can be useful in algorithmic analysis.
Mathematical Programming: Turing-completeness and Applications to Algorithmic Analysis / Leo, Liberti; Marinelli, Fabrizio. - ELETTRONICO. - (2013). (Intervento presentato al convegno INFORMS Annual Meeting tenutosi a Minneapolis, USA nel October 6-9, 2013).
Mathematical Programming: Turing-completeness and Applications to Algorithmic Analysis
MARINELLI, Fabrizio
2013-01-01
Abstract
We provide a new proof of the fact that Mathematical Programming is Turing-complete, and show how it can be useful in algorithmic analysis.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
