Constructivizing Membership Proofs in Complexity Classes

DOI10.1142/S0129054197000276zbMATH Open0892.68044OpenAlexW2154884611MaRDI QIDQ4385199

V. Arvind

Publication date: 27 July 1998

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

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

zbMATH Keywords

polynomial-time algorithmself-witnessing property

Mathematics Subject Classification ID

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

Related Items (1)

Title not available (Why is that?)

This page was built for publication: Constructivizing Membership Proofs in Complexity Classes

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