Antibiotics Time Machines Are Hard to Build

DOI10.1090/NOTI1590zbMath1376.92028OpenAlexW2766508030MaRDI QIDQ4599236

Jed Yang, Ngoc Mai Tran

Publication date: 18 December 2017

Published in: Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/noti1590

zbMATH Keywords

NP-hardresistance to antibiotics

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Medical applications (general) (92C50) Population dynamics (general) (92D25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Optimization problems involving matrix multiplication with applications in materials science and biology ⋮ Optimal Switching Sequence for Switched Linear Systems

This page was built for publication: Antibiotics Time Machines Are Hard to Build