Emptiness problems for integer circuits
D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, M.P. Technau, in: K.G. Larsen, H.L. Bodlaender, J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017, p. 33:1–33:14.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Barth, D.;
Beck, M.;
Dose, T.;
Glaßer, Ch.;
Michler, L.;
Technau, Marc PhilippLibreCat 
Editor
Larsen, Kim G.;
Bodlaender, Hans L.;
Raskin, Jean-Francois
Department
Publishing Year
Proceedings Title
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
forms.conference.field.series_title_volume.label
Leibniz International Proceedings in Informatics (LIPIcs)
Volume
83
Page
33:1–33:14
LibreCat-ID
Cite this
Barth D, Beck M, Dose T, Glaßer Ch, Michler L, Technau MP. Emptiness problems for integer circuits. In: Larsen KG, Bodlaender HL, Raskin J-F, eds. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Vol 83. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl–Leibniz-Zentrum für Informatik; 2017:33:1–33:14. doi:10.4230/LIPIcs.MFCS.2017.33
Barth, D., Beck, M., Dose, T., Glaßer, Ch., Michler, L., & Technau, M. P. (2017). Emptiness problems for integer circuits. In K. G. Larsen, H. L. Bodlaender, & J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Vol. 83, p. 33:1–33:14). Schloss Dagstuhl–Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.33
@inproceedings{Barth_Beck_Dose_Glaßer_Michler_Technau_2017, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Emptiness problems for integer circuits}, volume={83}, DOI={10.4230/LIPIcs.MFCS.2017.33}, booktitle={42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, publisher={Schloss Dagstuhl–Leibniz-Zentrum für Informatik}, author={Barth, D. and Beck, M. and Dose, T. and Glaßer, Ch. and Michler, L. and Technau, Marc Philipp}, editor={Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, year={2017}, pages={33:1–33:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }
Barth, D., M. Beck, T. Dose, Ch. Glaßer, L. Michler, and Marc Philipp Technau. “Emptiness Problems for Integer Circuits.” In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), edited by Kim G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin, 83:33:1–33:14. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.33.
D. Barth, M. Beck, T. Dose, Ch. Glaßer, L. Michler, and M. P. Technau, “Emptiness problems for integer circuits,” in 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017, vol. 83, p. 33:1–33:14, doi: 10.4230/LIPIcs.MFCS.2017.33.
Barth, D., et al. “Emptiness Problems for Integer Circuits.” 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), edited by Kim G. Larsen et al., vol. 83, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017, p. 33:1–33:14, doi:10.4230/LIPIcs.MFCS.2017.33.
Google Scholar