<--- Back to Details
First PageDocument Content
Mathematical logic / Mathematics / Theoretical computer science / Automated theorem proving / Logic in computer science / Methods of proof / Boolean algebra / Mathematical proofs / Proof complexity / Boolean satisfiability problem
Date: 2017-08-06 02:05:36
Mathematical logic
Mathematics
Theoretical computer science
Automated theorem proving
Logic in computer science
Methods of proof
Boolean algebra
Mathematical proofs
Proof complexity
Boolean satisfiability problem

The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, Sweden

Add to Reading List

Source URL: www.cs.utexas.edu

Download Document from Source Website

File Size: 128,49 KB

Share Document on Facebook

Similar Documents