Polynomial Time Productivity, Approximations, and Levelability

DOI10.1137/0221064zbMath0759.68025OpenAlexW2072789510MaRDI QIDQ4027860

Jie Wang

Publication date: 9 March 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221064

zbMATH Keywords

\(p\)-approximations\(p\)-levelability\(p\)-productivity

Mathematics Subject Classification ID

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

Related Items (3)

On P-immunity of exponential time complete sets ⋮ NP-Creative sets: A new class of creative sets in NP ⋮ On the size of classes with weak membership properties

This page was built for publication: Polynomial Time Productivity, Approximations, and Levelability