scientific article; zbMATH DE number 1522926
From MaRDI portal
Publication:4511222
zbMath0956.03050MaRDI QIDQ4511222
Publication date: 30 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (3)
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games ⋮ A characterization of tree-like resolution size ⋮ On the One-Way Function Candidate Proposed by Goldreich
This page was built for publication: