Overloading Is NP-Complete

DOI10.1007/978-3-642-29485-3_13zbMath1354.68099OpenAlexW207411393MaRDI QIDQ2897953

Jens Palsberg

Publication date: 16 July 2012

Published in: Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29485-3_13

Mathematics Subject Classification ID

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

This page was built for publication: Overloading Is NP-Complete