LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES

DOI10.1142/S0129054190000096zbMATH Open0726.68030OpenAlexW1970585244MaRDI QIDQ3348409FDOQ3348409

Authors: Giorgio Ausiello, Marco Protasi 

Publication date: 1990

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054190000096

Recommendations

• Limiting characterizations of low level space complexity classes
• The parallel complexity of function approximation
• Optimal Approximations and Polynomially Levelable Sets
• On the computational complexity of best Chebyshev approximations
• scientific article; zbMATH DE number 1860650

zbMATH Keywords

polynomial computabilitylimiting approximation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (4)

• The complexity of polynomial-time approximation
• Notes on polynomial levelability
• Title not available (Why is that?)
• Limiting characterizations of low level space complexity classes

This page was built for publication: LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES

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