A resolution-based interactive proof system for UNSAT

DOI10.1007/978-3-031-57231-9_6MaRDI QIDQ6629521

Philipp Czerner, Valentin Krasotin, Javier Esparza

Publication date: 30 October 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Resolution proofs of generalized pigeonhole principles
• The intractability of resolution
• Efficient, verified checking of propositional proofs
• Flexible proof production in an industrial-strength SMT solver
• Algebraic methods for interactive proof systems
• IP = PSPACE
• The knowledge complexity of interactive proof-systems
• Search Problems in the Decision Tree Model
• A Computing Procedure for Quantification Theory
• Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms

This page was built for publication: A resolution-based interactive proof system for UNSAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629521)