scientific article; zbMATH DE number 2086624

zbMath1056.03503MaRDI QIDQ4737159

Jochen Messner, Nicola Galesi, Juan Luis Esteban

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800220.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

resolutioncomplexity of proofs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (2)

On the automatizability of resolution and related propositional proof systems ⋮ On the complexity of resolution with bounded conjunctions

This page was built for publication: