scientific article; zbMATH DE number 1342213
From MaRDI portal
Publication:4263798
zbMath0934.03055MaRDI QIDQ4263798
Publication date: 25 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Complexity of proofs (03F20)
Related Items (4)
Nondeterministic functions and the existence of optimal proof systems ⋮ On an optimal randomized acceptor for graph nonisomorphism ⋮ Optimal heuristic algorithms for the image of an injective function ⋮ On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
This page was built for publication:
