scientific article; zbMATH DE number 1332674

DOI10.4086/cjtcs.1999.001zbMath0924.68098OpenAlexW4239560979MaRDI QIDQ4259996

Richard Chang, Robert Beals, Jacobo Toran, William I. Gasarch

Publication date: 8 September 1999

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.1999.001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Some connections between bounded query classes and non-uniform complexity. ⋮ On the reducibility of sets inside NP to sets with low information content ⋮ A combinatorial matrix approach for the generation of vacuum Feynman graphs multiplicities in $\phi^{4}$ theory ⋮ The enumerability of P collapses P to NC

This page was built for publication: