Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Fabian Egidy, Christian Glaßer, and Martin Herold. Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 44:1-44:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{egidy_et_al:LIPIcs.MFCS.2023.44, author = {Egidy, Fabian and Gla{\ss}er, Christian and Herold, Martin}, title = {{Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {44:1--44:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.44}, URN = {urn:nbn:de:0030-drops-185784}, doi = {10.4230/LIPIcs.MFCS.2023.44}, annote = {Keywords: Computational Complexity, Boolean Hierarchy, Proof Complexity, Proof Systems, Oracle Construction} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Anton Ehrmanntraut, Fabian Egidy, and Christian Glaßer. Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 45:1-45:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ehrmanntraut_et_al:LIPIcs.MFCS.2022.45, author = {Ehrmanntraut, Anton and Egidy, Fabian and Gla{\ss}er, Christian}, title = {{Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {45:1--45:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.45}, URN = {urn:nbn:de:0030-drops-168435}, doi = {10.4230/LIPIcs.MFCS.2022.45}, annote = {Keywords: computational complexity, promise classes, proof complexity, complete sets, oracle construction} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Titus Dose and Christian Glaßer. NP-Completeness, Proof Systems, and Disjoint NP-Pairs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dose_et_al:LIPIcs.STACS.2020.9, author = {Dose, Titus and Gla{\ss}er, Christian}, title = {{NP-Completeness, Proof Systems, and Disjoint NP-Pairs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.9}, URN = {urn:nbn:de:0030-drops-118707}, doi = {10.4230/LIPIcs.STACS.2020.9}, annote = {Keywords: NP-complete, propositional proof system, disjoint NP-pair, oracle} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, and Marc Technau. Emptiness Problems for Integer Circuits. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{barth_et_al:LIPIcs.MFCS.2017.33, author = {Barth, Dominik and Beck, Moritz and Dose, Titus and Gla{\ss}er, Christian and Michler, Larissa and Technau, Marc}, title = {{Emptiness Problems for Integer Circuits}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.33}, URN = {urn:nbn:de:0030-drops-80641}, doi = {10.4230/LIPIcs.MFCS.2017.33}, annote = {Keywords: computational complexity, integer expressions, integer circuits, polynomial identity testing} }
Published in: Dagstuhl Follow-Ups, Volume 3, Multimodal Music Processing (2012)
Christian Dittmar, Estefanía Cano, Jakob Abeßer, and Sascha Grollmisch. Music Information Retrieval Meets Music Education. In Multimodal Music Processing. Dagstuhl Follow-Ups, Volume 3, pp. 95-120, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InCollection{dittmar_et_al:DFU.Vol3.11041.95, author = {Dittmar, Christian and Cano, Estefan{\'\i}a and Abe{\ss}er, Jakob and Grollmisch, Sascha}, title = {{Music Information Retrieval Meets Music Education}}, booktitle = {Multimodal Music Processing}, pages = {95--120}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-37-8}, ISSN = {1868-8977}, year = {2012}, volume = {3}, editor = {M\"{u}ller, Meinard and Goto, Masataka and Schedl, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol3.11041.95}, URN = {urn:nbn:de:0030-drops-34689}, doi = {10.4230/DFU.Vol3.11041.95}, annote = {Keywords: Music learning, music transcription, source separation, performance feedback} }
Published in: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Christian Glaßer, Christian Reitwießner, and Maximilian Witek. Applications of Discrepancy Theory in Multiobjective Approximation. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 55-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{glaer_et_al:LIPIcs.FSTTCS.2011.55, author = {Gla{\ss}er, Christian and Reitwie{\ss}ner, Christian and Witek, Maximilian}, title = {{Applications of Discrepancy Theory in Multiobjective Approximation}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {55--65}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-34-7}, ISSN = {1868-8969}, year = {2011}, volume = {13}, editor = {Chakraborty, Supratik and Kumar, Amit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.55}, URN = {urn:nbn:de:0030-drops-33233}, doi = {10.4230/LIPIcs.FSTTCS.2011.55}, annote = {Keywords: Discrepancy Theory, Multiobjective Optimization, Satisfiability, Traveling Salesman} }
Feedback for Dagstuhl Publishing