scientific article; zbMATH DE number 6456550

MaRDI QIDQ5261855zbMATHFDO

Authors

Publication date 8 July 2015

Full work available at URL http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6596469

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(9)

• scientific article; zbMATH DE number 5937160 (Why is no real title available?)
• Proceedings of the fifth international workshop on implicit computational complexity, held in conjunction with LICS in Ottawa, ON, Canada, June 26--27, 2003
• scientific article; zbMATH DE number 1309064 (Why is no real title available?)
• scientific article; zbMATH DE number 6132036 (Why is no real title available?)
• Complexity of metric dimension on planar graphs
• scientific article; zbMATH DE number 6513107 (Why is no real title available?)
• scientific article; zbMATH DE number 6789923 (Why is no real title available?)
• scientific article; zbMATH DE number 5729464 (Why is no real title available?)
• scientific article; zbMATH DE number 5729452 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261855)