15 results on '"Sadowski, Zenon"'
Search Results
2. Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
3. Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT
4. A Straightforward Proof of Köbler-Messner’s Result
5. On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
6. On an Optimal Deterministic Algorithm for SAT
7. On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP
8. Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
9. On an Optimal Deterministic Algorithm for SAT
10. On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP
11. On an optimal propositional proof system and the structure of easy subsets of TAUT
12. Do there exist complete sets for promise classes?
13. On an Optimal Deterministic Algorithm for SAT.
14. Optimal Proof Systems, Optimal Acceptors and Recursive Presentability.
15. On Connections Between Parallel Programs and Nondeterministic Sequential Programs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.