Zenon Sadowski

11 papers B 2C 2Misc 1Journal 6
YearRankTypeTitle / Venue / Authors
2017 C conf
Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT.
CiE
Zenon Sadowski
2011 J jnl
Do there exist complete sets for promise classes?
Math. Log. Q.
Olaf Beyersdorff, Zenon Sadowski
2009 Misc conf
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.
CSR
Olaf Beyersdorff, Zenon Sadowski
2009 J jnl
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Zenon Sadowski
2008 J jnl
Optimal Proof Systems and Complete Languages.
Electron. Colloquium Comput. Complex.
Zenon Sadowski
2007 J jnl
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability.
Fundam. Informaticae
Zenon Sadowski
2005 J jnl
On a D-N-optimal acceptor for TAUT
Electron. Colloquium Comput. Complex.
Zenon Sadowski
2002 J jnl
On an optimal propositional proof system and the structure of easy subsets of TAUT.
Theor. Comput. Sci.
Zenon Sadowski
2001 C conf
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).
MCU
Zenon Sadowski
1998 B conf
On an Optimal Deterministic Algorithm for SAT.
CSL
Zenon Sadowski
1997 B conf
On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP.
FCT
Zenon Sadowski
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling