Zenon Sadowski

发表

Optimal Proof Systems and Complete Languages

Zenon Sadowski, 2008, Electron. Colloquium Comput. Complex..

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes

Zenon Sadowski, Olaf Beyersdorff, Olaf Beyersdorff, 2009, CSR.

On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)

Zenon Sadowski, Zenon Sadowski, 2001, MCU.

Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT

Zenon Sadowski, 2017, CiE.

On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP

Zenon Sadowski, Zenon Sadowski, 1997, FCT.

Do there exist complete sets for promise classes?

Zenon Sadowski, Olaf Beyersdorff, Olaf Beyersdorff, 2011, Math. Log. Q..

On a D-N-optimal acceptor for TAUT

Zenon Sadowski, 2005, Electron. Colloquium Comput. Complex..

A Straightforward Proof of Köbler-Messner’s Result

Zenon Sadowski, 2003 .

Optimal Proof Systems, Optimal Acceptors and Recursive Presentability

Zenon Sadowski, Zenon Sadowski, 2007, Fundam. Informaticae.

On an optimal propositional proof system and the structure of easy subsets of TAUT

Zenon Sadowski, Zenon Sadowski, 2002, Theor. Comput. Sci..

On an Optimal Deterministic Algorithm for SAT

Zenon Sadowski, 1998, CSL.

On an Optimal Quantiied Propositional Proof System and a Complete Language for Np \ Co-np

Zenon Sadowski, Zenon Sadowski, 1997 .