Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > AUTOMATIZABLE PROOF SYSTEMS:
Reports tagged with Automatizable proof systems:
TR05-077 | 15th July 2005
Zenon Sadowski

On a D-N-optimal acceptor for TAUT

The notion of an optimal acceptor for TAUT (the optimality
property is stated only for input strings from TAUT) comes from the line
of research aimed at resolving the question of whether optimal
propositional proof systems exist. In this paper we introduce two new
types of optimal acceptors, a D-N-optimal ... more >>>




ISSN 1433-8092 | Imprint