[{"series_title":"Beiträge zur Komparativen Theologie","_id":"42334","language":[{"iso":"ger"}],"publisher":"Brill | Schöningh","volume":31,"user_id":"85630","author":[{"full_name":"Ghaffar, Zishan","last_name":"Ghaffar","first_name":"Zishan"}],"year":"2018","status":"public","title":"Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung","intvolume":"        31","date_updated":"2023-02-24T15:41:17Z","date_created":"2023-02-23T09:01:36Z","place":"Paderborn","department":[{"_id":"784"}],"type":"book","citation":{"bibtex":"@book{Ghaffar_2018, place={Paderborn}, series={Beiträge zur Komparativen Theologie}, title={Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung}, volume={31}, publisher={Brill | Schöningh}, author={Ghaffar, Zishan}, year={2018}, collection={Beiträge zur Komparativen Theologie} }","ama":"Ghaffar Z. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Vol 31. Brill | Schöningh; 2018.","mla":"Ghaffar, Zishan. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Brill | Schöningh, 2018.","short":"Z. Ghaffar, Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung, Brill | Schöningh, Paderborn, 2018.","chicago":"Ghaffar, Zishan. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Vol. 31. Beiträge zur Komparativen Theologie. Paderborn: Brill | Schöningh, 2018.","ieee":"Z. Ghaffar, <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>, vol. 31. Paderborn: Brill | Schöningh, 2018.","apa":"Ghaffar, Z. (2018). <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i> (Vol. 31). Brill | Schöningh."}},{"author":[{"id":"67185","full_name":"Foerster, Anne","first_name":"Anne","last_name":"Foerster"}],"year":"2018","status":"public","title":"Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era","intvolume":"        18","publication_status":"published","date_updated":"2023-02-25T09:16:04Z","language":[{"iso":"ger"}],"_id":"41721","volume":18,"user_id":"73655","publication_date":"15.4.2018","citation":{"mla":"Foerster, Anne. “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era.” <i>Sehepunkte</i>, vol. 18, 2018.","bibtex":"@article{Foerster_2018, title={Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era}, volume={18}, journal={Sehepunkte}, author={Foerster, Anne}, year={2018} }","ama":"Foerster A. Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era. <i>Sehepunkte</i>. 2018;18.","ieee":"A. Foerster, “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era,” <i>Sehepunkte</i>, vol. 18. 2018.","apa":"Foerster, A. (2018). Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era. In <i>Sehepunkte</i> (Vol. 18).","short":"A. Foerster, Sehepunkte 18 (2018).","chicago":"Foerster, Anne. “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era.” <i>Sehepunkte</i>, 2018."},"publication":"Sehepunkte","date_created":"2023-02-05T15:03:05Z","department":[{"_id":"6"}],"type":"review"},{"page":"169-173","_id":"40926","language":[{"iso":"eng"}],"user_id":"73655","volume":1,"status":"public","title":"The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh","year":"2018","author":[{"first_name":"Anne","last_name":"Foerster","full_name":"Foerster, Anne","id":"67185"}],"publication_status":"published","date_updated":"2023-02-25T09:17:01Z","intvolume":"         1","date_created":"2023-01-30T12:36:12Z","type":"journal_article","department":[{"_id":"6"}],"publication":"Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte","citation":{"mla":"Foerster, Anne. “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i>, vol. 1, 2018, pp. 169–73.","bibtex":"@article{Foerster_2018, title={The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh}, volume={1}, journal={Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte}, author={Foerster, Anne}, year={2018}, pages={169–173} }","ama":"Foerster A. The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh. <i>Mittelalter Interdisziplinäre Forschung und Rezeptionsgeschichte</i>. 2018;1:169-173.","ieee":"A. Foerster, “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh,” <i>Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte</i>, vol. 1, pp. 169–173, 2018.","apa":"Foerster, A. (2018). The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh. <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i>, <i>1</i>, 169–173.","short":"A. Foerster, Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte 1 (2018) 169–173.","chicago":"Foerster, Anne. “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i> 1 (2018): 169–73."}},{"date_created":"2023-01-30T12:38:07Z","type":"journal_article","department":[{"_id":"6"}],"publication":"Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte ","citation":{"mla":"Foerster, Anne. “Female Rulership: The Case of Seaxburh, Queen of Wessex.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i>, vol. 1, 2018, pp. 164–68.","ama":"Foerster A. Female Rulership: The Case of Seaxburh, Queen of Wessex. <i>Mittelalter Interdisziplinäre Forschung und Rezeptionsgeschichte </i>. 2018;1:164-168.","bibtex":"@article{Foerster_2018, title={Female Rulership: The Case of Seaxburh, Queen of Wessex}, volume={1}, journal={Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte }, author={Foerster, Anne}, year={2018}, pages={164–168} }","apa":"Foerster, A. (2018). Female Rulership: The Case of Seaxburh, Queen of Wessex. <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i>, <i>1</i>, 164–168.","ieee":"A. Foerster, “Female Rulership: The Case of Seaxburh, Queen of Wessex,” <i>Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte </i>, vol. 1, pp. 164–168, 2018.","short":"A. Foerster, Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte  1 (2018) 164–168.","chicago":"Foerster, Anne. “Female Rulership: The Case of Seaxburh, Queen of Wessex.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i> 1 (2018): 164–68."},"page":"164-168","_id":"40929","language":[{"iso":"eng"}],"user_id":"73655","volume":1,"title":"Female Rulership: The Case of Seaxburh, Queen of Wessex","year":"2018","status":"public","author":[{"id":"67185","last_name":"Foerster","first_name":"Anne","full_name":"Foerster, Anne"}],"date_updated":"2023-02-25T09:16:46Z","publication_status":"published","intvolume":"         1"},{"citation":{"ama":"Foerster A. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>.; 2018. doi:<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>","bibtex":"@book{Foerster_2018, place={Ostfildern}, series={Mittelalter-Forschungen 57}, title={Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter}, DOI={<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>}, author={Foerster, Anne}, year={2018}, collection={Mittelalter-Forschungen 57} }","mla":"Foerster, Anne. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. 2018, doi:<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>.","chicago":"Foerster, Anne. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. Mittelalter-Forschungen 57. Ostfildern, 2018. <a href=\"https://doi.org/0000-0002-3848-3592\">https://doi.org/0000-0002-3848-3592</a>.","short":"A. Foerster, Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter, Ostfildern, 2018.","apa":"Foerster, A. (2018). <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. <a href=\"https://doi.org/0000-0002-3848-3592\">https://doi.org/0000-0002-3848-3592</a>","ieee":"A. Foerster, <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. Ostfildern, 2018."},"place":"Ostfildern","date_created":"2023-01-30T12:13:28Z","type":"book","status":"public","title":"Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter","year":"2018","author":[{"id":"67185","last_name":"Foerster","first_name":"Anne","full_name":"Foerster, Anne"}],"date_updated":"2023-02-25T09:17:30Z","publication_status":"published","series_title":"Mittelalter-Forschungen 57","_id":"40914","language":[{"iso":"ger"}],"doi":"0000-0002-3848-3592","user_id":"73655"},{"title":"Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb","year":"2018","status":"public","author":[{"full_name":"Grübel, Alexander","last_name":"Grübel","first_name":"Alexander"}],"publication_identifier":{"issn":["0178-9457"],"isbn":["978-3-18-334918-0"]},"date_updated":"2023-02-27T11:59:29Z","intvolume":"       349","page":"138","_id":"42535","series_title":"Fortschritt-Berichte VDI","language":[{"iso":"ger"}],"user_id":"45673","volume":349,"citation":{"chicago":"Grübel, Alexander. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. Vol. 349. Fortschritt-Berichte VDI, 2018.","short":"A. Grübel, Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb, 2018.","apa":"Grübel, A. (2018). <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i> (Vol. 349).","ieee":"A. Grübel, <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>, vol. 349. 2018.","ama":"Grübel A. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. Vol 349.; 2018.","bibtex":"@book{Grübel_2018, series={Fortschritt-Berichte VDI}, title={Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb}, volume={349}, author={Grübel, Alexander}, year={2018}, collection={Fortschritt-Berichte VDI} }","mla":"Grübel, Alexander. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. 2018."},"supervisor":[{"first_name":"Hans Albert","last_name":"Richard","full_name":"Richard, Hans Albert"}],"date_created":"2023-02-27T11:59:06Z","type":"dissertation","department":[{"_id":"143"}]},{"title":"3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen","year":"2018","status":"public","publication_identifier":{"isbn":["978-3-18-335018-6"],"issn":["0178-9457"]},"author":[{"last_name":"Dibblee","first_name":"Katharina","full_name":"Dibblee, Katharina"}],"date_updated":"2023-02-27T11:52:29Z","intvolume":"       350","page":"180","_id":"42533","language":[{"iso":"ger"}],"series_title":"Fortschritt-Berichte VDI","user_id":"45673","volume":350,"citation":{"apa":"Dibblee, K. (2018). <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i> (Vol. 350).","ieee":"K. Dibblee, <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>, vol. 350. 2018.","chicago":"Dibblee, Katharina. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. Vol. 350. Fortschritt-Berichte VDI, 2018.","short":"K. Dibblee, 3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen, 2018.","mla":"Dibblee, Katharina. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. 2018.","ama":"Dibblee K. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. Vol 350.; 2018.","bibtex":"@book{Dibblee_2018, series={Fortschritt-Berichte VDI}, title={3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen}, volume={350}, author={Dibblee, Katharina}, year={2018}, collection={Fortschritt-Berichte VDI} }"},"supervisor":[{"full_name":"Richard, Hans Albert","first_name":"Hans Albert","last_name":"Richard"}],"date_created":"2023-02-27T11:51:51Z","type":"dissertation","department":[{"_id":"143"}]},{"intvolume":"        51","publication_status":"published","date_updated":"2023-02-28T08:12:05Z","author":[{"last_name":"Scharlau","orcid":"0000-0003-2364-9489","first_name":"Ingrid","full_name":"Scharlau, Ingrid","id":"451"}],"year":"2018","status":"public","title":"Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.","volume":51,"user_id":"42165","_id":"31655","language":[{"iso":"ger"}],"page":"35 - 38","citation":{"chicago":"Scharlau, Ingrid. “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.” <i>Psychologieunterricht</i> 51 (2018): 35–38.","short":"I. Scharlau, Psychologieunterricht 51 (2018) 35–38.","apa":"Scharlau, I. (2018). Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie. <i>Psychologieunterricht</i>, <i>51</i>, 35–38.","ieee":"I. Scharlau, “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.,” <i>Psychologieunterricht</i>, vol. 51, pp. 35–38, 2018.","ama":"Scharlau I. Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie. <i>Psychologieunterricht</i>. 2018;51:35-38.","bibtex":"@article{Scharlau_2018, title={Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.}, volume={51}, journal={Psychologieunterricht}, author={Scharlau, Ingrid}, year={2018}, pages={35–38} }","mla":"Scharlau, Ingrid. “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.” <i>Psychologieunterricht</i>, vol. 51, 2018, pp. 35–38."},"publication":"Psychologieunterricht","department":[{"_id":"424"}],"keyword":["Unterrichtsfach Psychologie"],"type":"journal_article","date_created":"2022-06-05T01:21:46Z"},{"date_created":"2019-03-01T11:34:41Z","type":"conference","keyword":["search complexity","local Hamiltonian","Quantum SAT","algebraic geometry"],"department":[{"_id":"623"},{"_id":"7"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"text":"The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a \"matching\" or \"dimer covering\"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the \"matching\" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a \"matching\". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2018/9620/"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2018.38","title":"On Efficiently Solvable Cases of Quantum k-SAT","year":"2018","author":[{"first_name":"Marco","last_name":"Aldi","full_name":"Aldi, Marco"},{"full_name":"de Beaudrap, Niel","last_name":"de Beaudrap","first_name":"Niel"},{"full_name":"Gharibian, Sevag","first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541"},{"full_name":"Saeedi, Seyran","first_name":"Seyran","last_name":"Saeedi"}],"publication_identifier":{"unknown":["978-3-95977-086-6"]},"date_updated":"2023-02-28T11:01:16Z","publication_status":"published","intvolume":"       117","external_id":{"arxiv":["1712.09617"]},"place":"Dagstuhl, Germany","oa":"1","citation":{"apa":"Aldi, M., de Beaudrap, N., Gharibian, S., &#38; Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>","ieee":"M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 38:1-38:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","short":"M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 38:1-38:16.","chicago":"Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>.","mla":"Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","ama":"Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>","bibtex":"@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"page":"38:1-38:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8162","user_id":"71541","editor":[{"first_name":"Igor","last_name":"Potapov","full_name":"Potapov, Igor"},{"full_name":"Spirakis, Paul","first_name":"Paul","last_name":"Spirakis"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"volume":117,"status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"}},{"main_file_link":[{"url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640","open_access":"1"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.MFCS.2018.58","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","year":"2018","publication_identifier":{"unknown":["978-3-95977-086-6"]},"author":[{"full_name":"Gharibian, Sevag","first_name":"Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","id":"71541"},{"first_name":"Miklos","last_name":"Santha","full_name":"Santha, Miklos"},{"first_name":"Jamie","last_name":"Sikora","full_name":"Sikora, Jamie"},{"last_name":"Sundaram","first_name":"Aarthi","full_name":"Sundaram, Aarthi"},{"first_name":"Justin","last_name":"Yirka","full_name":"Yirka, Justin"}],"publication_status":"published","date_updated":"2023-02-28T11:01:03Z","intvolume":"       117","date_created":"2019-03-01T11:29:44Z","type":"conference","keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"],"department":[{"_id":"623"},{"_id":"7"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"lang":"eng","text":"The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs \"equivalent\"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of \"unentanglement\"), QMA(2) is strictly contained in NEXP."}],"page":"58:1-58:16","_id":"8161","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","user_id":"71541","volume":117,"editor":[{"first_name":"Igor","last_name":"Potapov","full_name":"Potapov, Igor"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"},{"last_name":"Worrell","first_name":"James","full_name":"Worrell, James"}],"status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"external_id":{"arxiv":["1805.11139"]},"place":"Dagstuhl, Germany","oa":"1","citation":{"mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","bibtex":"@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16."}},{"place":"Dagstuhl, Germany","external_id":{"arxiv":["1606.05626"]},"oa":"1","citation":{"bibtex":"@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating Local Measurements on Quantum Systems}, volume={73}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>}, booktitle={12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark}, year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum Systems. In: Wilde M, ed. <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>. Vol 73. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>","short":"S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.","chicago":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” In <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, 73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>.","ieee":"S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements on Quantum Systems,” in <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, Paris, France, 2018, vol. 73, p. 2:1-2:17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>.","apa":"Gharibian, S., &#38; Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i> (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>","mla":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, vol. 73, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8160","page":"2:1-2:17","editor":[{"full_name":"Wilde, Mark","first_name":"Mark","last_name":"Wilde"}],"volume":73,"user_id":"71541","conference":{"name":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","location":"Paris, France"},"status":"public","date_created":"2019-03-01T11:25:27Z","department":[{"_id":"623"},{"_id":"7"}],"type":"conference","keyword":["Complexity theory","Quantum Merlin Arthur (QMA)","local Hamiltonian","local measurement","spectral gap"],"publication":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","abstract":[{"text":"An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as \"slightly harder\" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \\subseteq PP. This improves the containment QMA \\subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a \"query validation\" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577"}],"doi":"10.4230/LIPIcs.TQC.2017.2","publication_identifier":{"unknown":["978-3-95977-034-7"]},"author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"title":"The Complexity of Simulating Local Measurements on Quantum Systems","year":"2018","intvolume":"        73","date_updated":"2023-02-28T11:00:48Z","publication_status":"published"},{"doi":"10.1145/3186587","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.3182"}],"intvolume":"        10","publication_status":"published","date_updated":"2023-02-28T11:01:36Z","publication_identifier":{"issn":["1942-3454"]},"author":[{"id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag"},{"last_name":"Sikora","first_name":"Jamie","full_name":"Sikora, Jamie"}],"year":"2018","title":"Ground State Connectivity of Local Hamiltonians","department":[{"_id":"623"},{"_id":"7"}],"type":"journal_article","keyword":["Local Hamiltonian","ground state connectivity","quantum Hamiltonian complexity","reconfiguration problem"],"date_created":"2019-03-01T11:49:31Z","publication":"ACM Transactions on Computation Theory (TOCT)","issue":"2","volume":10,"user_id":"71541","publisher":"ACM","_id":"8167","page":"8:1-8:28","status":"public","oa":"1","external_id":{"arxiv":["1409.3182"]},"citation":{"mla":"Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.” <i>ACM Transactions on Computation Theory (TOCT)</i>, vol. 10, no. 2, ACM, 2018, p. 8:1-8:28, doi:<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>.","bibtex":"@article{Gharibian_Sikora_2018, title={Ground State Connectivity of Local Hamiltonians}, volume={10}, DOI={<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>}, number={2}, journal={ACM Transactions on Computation Theory (TOCT)}, publisher={ACM}, author={Gharibian, Sevag and Sikora, Jamie}, year={2018}, pages={8:1-8:28} }","ama":"Gharibian S, Sikora J. Ground State Connectivity of Local Hamiltonians. <i>ACM Transactions on Computation Theory (TOCT)</i>. 2018;10(2):8:1-8:28. doi:<a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>","ieee":"S. Gharibian and J. Sikora, “Ground State Connectivity of Local Hamiltonians,” <i>ACM Transactions on Computation Theory (TOCT)</i>, vol. 10, no. 2, p. 8:1-8:28, 2018, doi: <a href=\"https://doi.org/10.1145/3186587\">10.1145/3186587</a>.","apa":"Gharibian, S., &#38; Sikora, J. (2018). Ground State Connectivity of Local Hamiltonians. <i>ACM Transactions on Computation Theory (TOCT)</i>, <i>10</i>(2), 8:1-8:28. <a href=\"https://doi.org/10.1145/3186587\">https://doi.org/10.1145/3186587</a>","chicago":"Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.” <i>ACM Transactions on Computation Theory (TOCT)</i> 10, no. 2 (2018): 8:1-8:28. <a href=\"https://doi.org/10.1145/3186587\">https://doi.org/10.1145/3186587</a>.","short":"S. Gharibian, J. Sikora, ACM Transactions on Computation Theory (TOCT) 10 (2018) 8:1-8:28."}},{"_id":"42128","publisher":"Shaker Verlag","page":"135","volume":5,"user_id":"98856","status":"public","place":"Aachen","supervisor":[{"first_name":"Hans-Joachim","orcid":"000-0001-8590-1921","last_name":"Schmid","full_name":"Schmid, Hans-Joachim","id":"464"}],"citation":{"ama":"Pieper S. <i>Confinement Induced Segregation Effects in Suspension Rheology</i>. Vol 5. Shaker Verlag; 2018.","bibtex":"@book{Pieper_2018, place={Aachen}, series={Schriftenreihe Lehrstuhl für Partikelverfahrenstechnik}, title={Confinement Induced Segregation Effects in Suspension Rheology}, volume={5}, publisher={Shaker Verlag}, author={Pieper, Sven}, year={2018}, collection={Schriftenreihe Lehrstuhl für Partikelverfahrenstechnik} }","mla":"Pieper, Sven. <i>Confinement Induced Segregation Effects in Suspension Rheology</i>. Shaker Verlag, 2018.","short":"S. Pieper, Confinement Induced Segregation Effects in Suspension Rheology, Shaker Verlag, Aachen, 2018.","chicago":"Pieper, Sven. <i>Confinement Induced Segregation Effects in Suspension Rheology</i>. Vol. 5. Schriftenreihe Lehrstuhl Für Partikelverfahrenstechnik. Aachen: Shaker Verlag, 2018.","apa":"Pieper, S. (2018). <i>Confinement Induced Segregation Effects in Suspension Rheology</i> (Vol. 5). Shaker Verlag.","ieee":"S. Pieper, <i>Confinement Induced Segregation Effects in Suspension Rheology</i>, vol. 5. Aachen: Shaker Verlag, 2018."},"language":[{"iso":"eng"}],"series_title":"Schriftenreihe Lehrstuhl für Partikelverfahrenstechnik","publication_identifier":{"isbn":["978-3-8440-5879-6"]},"author":[{"last_name":"Pieper","first_name":"Sven","full_name":"Pieper, Sven"}],"year":"2018","title":"Confinement Induced Segregation Effects in Suspension Rheology","intvolume":"         5","date_updated":"2023-02-28T11:07:18Z","publication_status":"published","date_created":"2023-02-15T08:33:55Z","department":[{"_id":"150"}],"type":"dissertation"},{"author":[{"full_name":"Grimm, Philipp","last_name":"Grimm","first_name":"Philipp"}],"title":"Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln","year":"2018","status":"public","date_updated":"2023-02-28T11:07:12Z","publication_status":"published","language":[{"iso":"ger"}],"_id":"42130","page":"201","user_id":"98856","supervisor":[{"id":"464","last_name":"Schmid","orcid":"000-0001-8590-1921","first_name":"Hans-Joachim","full_name":"Schmid, Hans-Joachim"}],"citation":{"ama":"Grimm P. <i>Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln</i>.; 2018.","bibtex":"@book{Grimm_2018, title={Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln}, author={Grimm, Philipp}, year={2018} }","mla":"Grimm, Philipp. <i>Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln</i>. 2018.","chicago":"Grimm, Philipp. <i>Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln</i>, 2018.","short":"P. Grimm, Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln, 2018.","apa":"Grimm, P. (2018). <i>Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln</i>.","ieee":"P. Grimm, <i>Entwicklung einer Prozesskette zum flüssig-flüssig Phasentransfer nanoskaliger Partikeln</i>. 2018."},"date_created":"2023-02-15T08:42:52Z","department":[{"_id":"150"}],"type":"dissertation"},{"author":[{"last_name":"Dörmann","first_name":"Michael","full_name":"Dörmann, Michael"}],"title":"Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln","status":"public","year":"2018","date_updated":"2023-02-28T11:07:09Z","publication_status":"published","language":[{"iso":"ger"}],"_id":"42131","page":"175","user_id":"98856","supervisor":[{"id":"464","first_name":"Hans-Joachim","last_name":"Schmid","orcid":"000-0001-8590-1921","full_name":"Schmid, Hans-Joachim"}],"citation":{"mla":"Dörmann, Michael. <i>Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln</i>. 2018.","ama":"Dörmann M. <i>Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln</i>.; 2018.","bibtex":"@book{Dörmann_2018, title={Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln}, author={Dörmann, Michael}, year={2018} }","apa":"Dörmann, M. (2018). <i>Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln</i>.","ieee":"M. Dörmann, <i>Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln</i>. 2018.","short":"M. Dörmann, Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln, 2018.","chicago":"Dörmann, Michael. <i>Zur Modellierung von Kapillarbrücken zwischen nanoskaligen Partikeln</i>, 2018."},"date_created":"2023-02-15T08:45:08Z","department":[{"_id":"150"}],"type":"dissertation"},{"date_created":"2023-03-03T13:07:30Z","department":[{"_id":"157"}],"type":"dissertation","citation":{"ieee":"R. Hörhold, <i>Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens</i>. 2018.","apa":"Hörhold, R. (2018). <i>Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens</i>.","short":"R. Hörhold, Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens, 2018.","chicago":"Hörhold, Réjane. <i>Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens</i>, 2018.","mla":"Hörhold, Réjane. <i>Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens</i>. 2018.","bibtex":"@book{Hörhold_2018, title={Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens}, author={Hörhold, Réjane}, year={2018} }","ama":"Hörhold R. <i>Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens</i>.; 2018."},"_id":"42708","language":[{"iso":"ger"}],"user_id":"15324","author":[{"full_name":"Hörhold, Réjane","first_name":"Réjane","last_name":"Hörhold"}],"publication_identifier":{"isbn":["978-3-8440-6297-7"]},"year":"2018","status":"public","title":"Untersuchungen zum methodenbasierten Prozessverständnis des radialsymmetrischen Schneidclinchens","date_updated":"2023-03-03T13:07:35Z"},{"user_id":"15324","language":[{"iso":"ger"}],"_id":"42711","date_updated":"2023-03-03T13:21:08Z","publication_identifier":{"isbn":["978-3-8440-5994-6"]},"author":[{"full_name":"Menne, Franz Ferdinand","first_name":"Franz Ferdinand","last_name":"Menne"}],"title":"Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten","year":"2018","status":"public","department":[{"_id":"157"}],"type":"dissertation","date_created":"2023-03-03T13:21:03Z","citation":{"short":"F.F. Menne, Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten, 2018.","chicago":"Menne, Franz Ferdinand. <i>Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten</i>, 2018.","ieee":"F. F. Menne, <i>Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten</i>. 2018.","apa":"Menne, F. F. (2018). <i>Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten</i>.","bibtex":"@book{Menne_2018, title={Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten}, author={Menne, Franz Ferdinand}, year={2018} }","ama":"Menne FF. <i>Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten</i>.; 2018.","mla":"Menne, Franz Ferdinand. <i>Automatisierte Variantenreduzierung durch virtuelle Verbindungsauslegung beim Halbhohlstanznieten</i>. 2018."}},{"place":"Beijing","date_created":"2023-01-26T02:15:37Z","type":"book","department":[{"_id":"136"}],"citation":{"bibtex":"@book{Fuchs_2018, place={Beijing}, title={社交媒体 批判导言}, publisher={Communication University of China Press}, author={Fuchs Christian}, year={2018} }","ama":"Fuchs C. 社交媒体 批判导言. Communication University of China Press; 2018.","mla":"Fuchs Christian. 社交媒体 批判导言. Communication University of China Press, 2018.","chicago":"Fuchs Christian. 社交媒体 批判导言. Beijing: Communication University of China Press, 2018.","short":"Fuchs C., 社交媒体 批判导言, Communication University of China Press, Beijing, 2018.","ieee":"Fuchs C., 社交媒体 批判导言. Beijing: Communication University of China Press, 2018.","apa":"Fuchs C. (2018). <i>社交媒体 批判导言</i>. Communication University of China Press."},"extern":"1","_id":"40139","publisher":"Communication University of China Press","language":[{"iso":"chi"}],"user_id":"49063","status":"public","year":"2018","title":"社交媒体 批判导言","author":[{"id":"21863","last_name":"Fuchs","first_name":"Christian","orcid":"0000-0003-0589-4579","full_name":"Fuchs, Christian"}],"date_updated":"2023-03-06T04:32:44Z","publication_status":"published"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.16997/book24"}],"publisher":"University of Westminster Press","_id":"40126","language":[{"iso":"eng"}],"user_id":"49063","doi":"https://doi.org/10.16997/book24","status":"public","year":"2018","title":"The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short version)","author":[{"id":"21863","full_name":"Fuchs, Christian","first_name":"Christian","orcid":"0000-0003-0589-4579","last_name":"Fuchs"}],"date_updated":"2023-03-06T04:34:39Z","date_created":"2023-01-26T01:41:40Z","place":"London","type":"book","department":[{"_id":"136"}],"oa":"1","citation":{"ieee":"C. Fuchs, <i>The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short version)</i>. London: University of Westminster Press, 2018.","apa":"Fuchs, C. (2018). <i>The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short version)</i>. University of Westminster Press. <a href=\"https://doi.org/10.16997/book24\">https://doi.org/10.16997/book24</a>","short":"C. Fuchs, The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short Version), University of Westminster Press, London, 2018.","chicago":"Fuchs, Christian. <i>The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short Version)</i>. London: University of Westminster Press, 2018. <a href=\"https://doi.org/10.16997/book24\">https://doi.org/10.16997/book24</a>.","mla":"Fuchs, Christian. <i>The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short Version)</i>. University of Westminster Press, 2018, doi:<a href=\"https://doi.org/10.16997/book24\">https://doi.org/10.16997/book24</a>.","bibtex":"@book{Fuchs_2018, place={London}, title={The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short version)}, DOI={<a href=\"https://doi.org/10.16997/book24\">https://doi.org/10.16997/book24</a>}, publisher={University of Westminster Press}, author={Fuchs, Christian}, year={2018} }","ama":"Fuchs C. <i>The Online Advertising Tax. A Digital Policy Innovation. CAMRI Policy Briefs No. 1. (Short Version)</i>. University of Westminster Press; 2018. doi:<a href=\"https://doi.org/10.16997/book24\">https://doi.org/10.16997/book24</a>"},"extern":"1"},{"citation":{"apa":"Fuchs, C. (2018). <i>The Online Advertising Tax as the Foundation of a Public Service Internet</i>. University of Westminster Press. <a href=\"https://doi.org/10.16997/book23\">https://doi.org/10.16997/book23</a>","ieee":"C. Fuchs, <i>The Online Advertising Tax as the Foundation of a Public Service Internet</i>. London: University of Westminster Press, 2018.","short":"C. Fuchs, The Online Advertising Tax as the Foundation of a Public Service Internet, University of Westminster Press, London, 2018.","chicago":"Fuchs, Christian. <i>The Online Advertising Tax as the Foundation of a Public Service Internet</i>. London: University of Westminster Press, 2018. <a href=\"https://doi.org/10.16997/book23\">https://doi.org/10.16997/book23</a>.","mla":"Fuchs, Christian. <i>The Online Advertising Tax as the Foundation of a Public Service Internet</i>. University of Westminster Press, 2018, doi:<a href=\"https://doi.org/10.16997/book23\">https://doi.org/10.16997/book23</a>.","ama":"Fuchs C. <i>The Online Advertising Tax as the Foundation of a Public Service Internet</i>. University of Westminster Press; 2018. doi:<a href=\"https://doi.org/10.16997/book23\">https://doi.org/10.16997/book23</a>","bibtex":"@book{Fuchs_2018, place={London}, title={The Online Advertising Tax as the Foundation of a Public Service Internet}, DOI={<a href=\"https://doi.org/10.16997/book23\">https://doi.org/10.16997/book23</a>}, publisher={University of Westminster Press}, author={Fuchs, Christian}, year={2018} }"},"extern":"1","place":"London","date_created":"2023-01-26T01:38:06Z","oa":"1","department":[{"_id":"136"}],"type":"book","author":[{"id":"21863","orcid":"0000-0003-0589-4579","first_name":"Christian","last_name":"Fuchs","full_name":"Fuchs, Christian"}],"year":"2018","status":"public","title":"The Online Advertising Tax as the Foundation of a Public Service Internet","date_updated":"2023-03-06T04:35:11Z","publisher":"University of Westminster Press","_id":"40125","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.16997/book23","open_access":"1"}],"doi":"https://doi.org/10.16997/book23","user_id":"49063"}]