{"page":"33:1–33:14","date_updated":"2024-07-16T11:53:40Z","extern":"1","intvolume":" 83","publisher":"Schloss Dagstuhl–Leibniz-Zentrum für Informatik","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","citation":{"ama":"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","apa":"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","chicago":"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.","mla":"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.","bibtex":"@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)} }","ieee":"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.","short":"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."},"year":"2017","volume":83,"language":[{"iso":"eng"}],"status":"public","doi":"10.4230/LIPIcs.MFCS.2017.33","_id":"55292","editor":[{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."},{"first_name":"Hans L.","full_name":"Bodlaender, Hans L.","last_name":"Bodlaender"},{"first_name":"Jean-Francois","full_name":"Raskin, Jean-Francois","last_name":"Raskin"}],"type":"conference","department":[{"_id":"102"}],"author":[{"first_name":"D.","last_name":"Barth","full_name":"Barth, D."},{"first_name":"M.","full_name":"Beck, M.","last_name":"Beck"},{"full_name":"Dose, T.","last_name":"Dose","first_name":"T."},{"full_name":"Glaßer, Ch.","last_name":"Glaßer","first_name":"Ch."},{"first_name":"L.","full_name":"Michler, L.","last_name":"Michler"},{"orcid":"0000-0001-9650-2459","last_name":"Technau","full_name":"Technau, Marc Philipp","first_name":"Marc Philipp","id":"106108"}],"title":"Emptiness problems for integer circuits","date_created":"2024-07-16T11:09:20Z","publication":"42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)","user_id":"106108"}