PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Dose, Titus"

Author of the publication

copydeleteadd this publication to your clipboard
Emptiness Problems for Integer Circuits.

, , , , , and . MFCS, volume 83 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hon. -Prof. Dr. Michael Doser University of Stuttgart

Jun. -Prof. Dr. phil. Titus von der Malsburg University of Stuttgart

 

Other publications of authors with the same name

NP-Completeness, Proof Systems, and Disjoint NP-Pairs., and . Electronic Colloquium on Computational Complexity (ECCC), (2019)Balance Problems for Integer Circuits.. MFCS, volume 117 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Complexity of Constraint Satisfaction Problems over Finite Substsets of Natural Numbers.. Electronic Colloquium on Computational Complexity (ECCC), (2016)P≠NP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle.. CoRR, (2019)P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle.. MFCS, volume 138 of LIPIcs, page 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Emptiness Problems for Integer Circuits., , , , , and . MFCS, volume 83 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Balance problems for integer circuits.. Theor. Comput. Sci., (2019)Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.. MFCS, volume 58 of LIPIcs, page 32:1-32:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle.. CoRR, (2019)Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle.. FCT, volume 11651 of Lecture Notes in Computer Science, page 153-167. Springer, (2019)