Resource bounds and subproblem independence

DOI10.1007/S00224-004-1160-8zbMath1085.68059OpenAlexW2034870758MaRDI QIDQ2581008

Harry B. III Hunt, Richard E. Stearns

Publication date: 10 January 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1160-8

zbMATH Keywords

\(q\)-linear functions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Resource bounds and subproblem independence