scientific article

From MaRDI portal

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

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

Publication:3696516

Jump to:navigation, search

zbMath0576.68032MaRDI QIDQ3696516

Juris Hartmanis

Publication date: 1985

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

zbMATH Keywords

reducibility oracle relativized complexity classes complete language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (7)

A characterization of the leaf language classes ⋮ On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP ⋮ A note on complete problems for complexity classes ⋮ Relativized counting classes: Relations among thresholds, parity, and mods ⋮ Complexity classes without machines: on complete languages for UP ⋮ On the complexity of ranking ⋮ Separating complexity classes with tally oracles

This page was built for publication:

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