Publication:4133135
From MaRDI portal
zbMath0357.68056MaRDI QIDQ4133135
Publication date: 1974
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03D10: Turing machines and related notions
Related Items
A natural encoding scheme proved probabilistic polynomial complete, The complexity of computing the permanent, Uniform complexity and digital signatures, Semantics of probabilistic programs, Universal classes of hash functions, Randomised algorithms