scientific article; zbMATH DE number 3596249
From MaRDI portal
Publication:4162663
zbMath0383.68043MaRDI QIDQ4162663
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
The complexity of online bribery in sequential elections ⋮ Collapsing degrees via strong computation ⋮ Completeness for nondeterministic complexity classes ⋮ A comparison of polynomial time completeness notions ⋮ On hardness of one-way functions ⋮ Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets ⋮ Possibilities of various types of alternating automata ⋮ On the complexity of ranking ⋮ Inverse monoids associated with the complexity class NP ⋮ Verifying time complexity of Turing machines ⋮ Lower bounds and the hardness of counting properties ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems ⋮ On some natural complete operators ⋮ On one-one polynomial time equivalence relations ⋮ Independence results about context-free languages and lower bounds
This page was built for publication:
