The complexity of error metrics

DOI10.1016/J.IPL.2018.06.010zbMath1433.68172DBLPjournals/ipl/KeszoczeSD18OpenAlexW2810969744WikidataQ60373811 ScholiaQ60373811MaRDI QIDQ1799556

Rolf Drechsler, Mathias Soeken, Oliver Keszocze

Publication date: 19 October 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.06.010

zbMATH Keywords

computational complexityapproximate computingerror metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• The complexity of optimization problems
• Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
• The complexity of theorem-proving procedures

This page was built for publication: The complexity of error metrics