On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
3rd International Conference on Machines, Computations, and Universality, Chisinau, Moldovia, May 23-27, 2001
As part of our website, we use cookies stored on the user's device in order to adapt the website's behavior to the user's individual preferences and for statistical purposes. You can change your cookie settings in your web browser yourself. For more information, please see the Privacy Policy of the University of Białystok. By using this website, you consent to the use of cookies in accordance with your browser settings.
