Titus Dose

17 papers A 1B 4Journal 11
YearRankTypeTitle / Venue / Authors
2021 — —
Balance Problems for Integer Circuits and Separations of Relativized Conjectures on Incompleteness in Promise Classes (Balance-Probleme für Integer Circuits und Separierungen Relativierter Vermutungen über Unvollständigkeit in Promise-Klassen)
Titus Dose
2020 J jnl
An oracle separating conjectures about incompleteness in the finite domain.
Theor. Comput. Sci.
Titus Dose
2020 J jnl
Emptiness problems for integer circuits.
Theor. Comput. Sci.
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
2020 J jnl
Further oracles separating conjectures about incompleteness in the finite domain.
Theor. Comput. Sci.
Titus Dose
2020 A conf
NP-Completeness, Proof Systems, and Disjoint NP-Pairs.
STACS
Titus Dose, Christian Glaßer
2019 J jnl
Balance problems for integer circuits.
Theor. Comput. Sci.
Titus Dose
2019 J jnl
NP-Completeness, Proof Systems, and Disjoint NP-Pairs.
Electron. Colloquium Comput. Complex.
Titus Dose, Christian Glaßer
2019 B conf
P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle.
MFCS
Titus Dose
2019 J jnl
P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle.
CoRR
Titus Dose
2019 J jnl
P-Optimal Proof Systems for Each Set in coNP and no Complete Problems in NP⋂coNP Relative to an Oracle.
CoRR
Titus Dose
2019 J jnl
P≠NP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle.
CoRR
Titus Dose
2018 B conf
Balance Problems for Integer Circuits.
MFCS
Titus Dose
2018 J jnl
Balance Problems for Integer Circuits.
Electron. Colloquium Comput. Complex.
Titus Dose
2017 B conf
Emptiness Problems for Integer Circuits.
MFCS
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
2017 J jnl
Emptiness Problems for Integer Circuits.
Electron. Colloquium Comput. Complex.
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
2016 B conf
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
MFCS
Titus Dose
2016 J jnl
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
Electron. Colloquium Comput. Complex.
Titus Dose