| |
| 2008 | ||
|---|---|---|
| 7 | EE | Zenon Sadowski: Optimal Proof Systems and Complete Languages. Electronic Colloquium on Computational Complexity (ECCC) 15(107): (2008) |
| 2007 | ||
| 6 | EE | Zenon Sadowski: Optimal Proof Systems, Optimal Acceptors and Recursive Presentability. Fundam. Inform. 79(1-2): 169-185 (2007) |
| 2005 | ||
| 5 | EE | Zenon Sadowski: On a D-N-optimal acceptor for TAUT Electronic Colloquium on Computational Complexity (ECCC)(077): (2005) |
| 2002 | ||
| 4 | Zenon Sadowski: On an optimal propositional proof system and the structure of easy subsets of TAUT. Theor. Comput. Sci. 288(1): 181-193 (2002) | |
| 2001 | ||
| 3 | EE | Zenon Sadowski: On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT). MCU 2001: 300-307 |
| 1998 | ||
| 2 | Zenon Sadowski: On an Optimal Deterministic Algorithm for SAT. CSL 1998: 179-187 | |
| 1997 | ||
| 1 | Zenon Sadowski: On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP. FCT 1997: 423-428 | |