Reliable identification of bounded-length viruses is NP-complete

DOI10.1109/TIT.2002.806137zbMath1063.68045OpenAlexW2166564602WikidataQ56169849 ScholiaQ56169849MaRDI QIDQ4679900

Diomidis D. Spinellis

Publication date: 31 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2002.806137

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of software (68N99)

Related Items (3)

A new definition of virus ⋮ On the infeasibility of modeling polymorphic shellcode. Re-thinking the role of learning in intrusion detection systems ⋮ Using algebraic models of programs for detecting metamorphic malwares

This page was built for publication: Reliable identification of bounded-length viruses is NP-complete