scientific article

From MaRDI portal

Revision as of 14:22, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3802608

Jump to:navigation, search

zbMath0655.68043MaRDI QIDQ3802608

Hemaspaandra, Lane A., Juris Hartmanis

Publication date: 1986

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

zbMATH Keywords

complexity classes Boolean formulas BPP probabilistic classes complete languages counting class UP recursive enumerations of machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (5)

On intractability of the classUP ⋮ On relativizations with restricted number of accesses to the oracle set ⋮ Structural complexity of AvgBPP ⋮ Robust machines accept easy sets ⋮ Structural Complexity of AvgBPP

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3802608&oldid=17372062"