scientific article; zbMATH DE number 3557236
From MaRDI portal
Publication:4133135
zbMath0357.68056MaRDI QIDQ4133135
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10)
Related Items (13)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Complexity of probabilistic versus deterministic automata ⋮ A natural encoding scheme proved probabilistic polynomial complete ⋮ The complexity of computing the permanent ⋮ On using probabilistic Turing machines to model participants in cryptographic protocols ⋮ On counting propositional logic and Wagner's hierarchy ⋮ The stochastic arrival problem ⋮ Uniform complexity and digital signatures ⋮ Semantics of probabilistic programs ⋮ Unnamed Item ⋮ Universal classes of hash functions ⋮ Randomised algorithms ⋮ On measure quantifiers in first-order arithmetic
This page was built for publication:
