Zenon Sadowski

According to our database, Zenon Sadowski authored at least 10 papers between 1997 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

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

Zenon Sadowski

Proceedings of the Unveiling Dynamics and Complexity, 2017

2011

Do there exist complete sets for promise classes?

Olaf Beyersdorff, Zenon Sadowski

Math. Log. Q., 2011

2009

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

Olaf Beyersdorff, Zenon Sadowski

Electron. Colloquium Comput. Complex., 2009

2008

Optimal Proof Systems and Complete Languages.

Zenon Sadowski

Electron. Colloquium Comput. Complex., 2008

2007

Optimal Proof Systems, Optimal Acceptors and Recursive Presentability.

Zenon Sadowski

Fundam. Informaticae, 2007

2005

On a D-N-optimal acceptor for TAUT

Zenon Sadowski

Electron. Colloquium Comput. Complex., 2005

2002

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

Zenon Sadowski

Theor. Comput. Sci., 2002

2001

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

Zenon Sadowski

Proceedings of the Machines, 2001

1998

On an Optimal Deterministic Algorithm for SAT.

Zenon Sadowski

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

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

Zenon Sadowski

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997