@misc{18732,
author = {{Peckhaus, Volker}},
booktitle = {{zbMATH Open, Zbl. 1372.01081}},
title = {{{Bolzano, Bernard, Briefwechsel mit Franz Exner, 1833–1844, hg. v. Edgar Morscher (Bernard Bolzano-Gesamtausgabe, Reihe III.23,1), Fromman-Holzboog Verlag: Stuttgart-Bad Cannstatt 2017}}},
year = {{2018}},
}
@misc{17634,
author = {{Peckhaus, Volker}},
booktitle = {{Stanford Encyclopedia of Philosophy (Fall 2018 Edition)}},
editor = {{Zalta, Edward N.}},
title = {{{Scholz, Heinrich}}},
year = {{2018}},
}
@article{36011,
abstract = {{Abstract
This article studies the anti-racist writings by contemporary scholars Cornel West, Eddie S. Glaude, Jr., George Yancy, and Claudia Rankine. It uncovers how they include personal narratives in their works in order to theorise the workings of white hegemony in the twenty-first century. In doing so, I argue, they productively blur the lines between the personal and the theoretical as well as between the past and the present. Consequently, they problematise the notion of abstract theorising, the myth of continuous racial progress as well as conceptions of postracialism.}},
author = {{Hartmann, Alexandra}},
issn = {{2451-3474}},
journal = {{Open Cultural Studies}},
keywords = {{General Social Sciences, General Arts and Humanities}},
number = {{1}},
pages = {{224--235}},
publisher = {{Walter de Gruyter GmbH}},
title = {{{The Personal Is Theoretical and the Past Is Present: Blurring the Lines in Contemporary Anti-Racist Writing}}},
doi = {{10.1515/culture-2018-0021}},
volume = {{2}},
year = {{2018}},
}
@misc{18729,
author = {{Peckhaus, Volker}},
booktitle = {{zbMATH Open, Zbl. 1391.01051}},
title = {{{Bolzano, Bernard, Erbauungsreden des Studienjahres 1817/18, Teilband 1, hg. v. Kurt F. Strasser (Bernard Bolzano-Gesamtausgabe, Reihe II.A.23,1), Fromman-Holzboog Verlag: Stuttgart-Bad Cannstatt 2015}}},
year = {{2018}},
}
@misc{18733,
author = {{Peckhaus, Volker}},
booktitle = {{zbMATH Open, Zbl. 1403.03006}},
title = {{{von Plato, Jan, “Kurt Gödel’s First Steps in Logic: Formal Proofs in Arithmetic and Set Theory Through a System of Natural Deduction”, The Bulletin of Symbolic Logic 24 (2018), 319–335}}},
year = {{2018}},
}
@misc{18731,
author = {{Peckhaus, Volker}},
booktitle = {{zbMATH Open, Zbl. 1390.00051}},
title = {{{Schubring, Gert, “Searches for the Origins of the Epistemological Concept of Model in Mathematics”, Archive for History of Exact Sciences 71 (2017), 245–278}}},
year = {{2018}},
}
@article{50602,
author = {{Hälterlein, Jens and Ostermeier, Lars}},
issn = {{2365-0931}},
journal = {{European Journal for Security Research}},
keywords = {{General Medicine}},
number = {{2}},
pages = {{91--94}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Special Issue: Predictive Security Technologies (Editorial)}}},
doi = {{10.1007/s41125-018-0034-z}},
volume = {{3}},
year = {{2018}},
}
@phdthesis{42064,
author = {{Oestersötebier, Felix}},
isbn = {{9783942647977}},
publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}},
title = {{{Modellbasierter Entwurf intelligenter mechatronischer Systeme mithilfe semantischer Technologien}}},
volume = {{378}},
year = {{2018}},
}
@misc{55495,
author = {{Büter, Mara Samira}},
publisher = {{Kipu-Verlag}},
title = {{{Globales Lernen im Spanischunterricht. Eine Handreichung für Lehrerinnen und Lehrer}}},
year = {{2018}},
}
@inproceedings{8575,
abstract = {{The transition from high school to university mathematics has proven to be difficult for many students but especially for pre-service secondary teachers. To support these students at mastering this transition, various universities have introduced support measures of various kinds. The WiGeMath project developed a taxonomy that makes it possible to describe and compare these measures concerning their goals as well as their frame characteristics. We will exemplify the use of the taxonomy in the description of one specific innovative measure that was part of the WiGeMath evaluations. Moreover, we will present first results concerning the goal-fulfilment of this measure concerning affective characteristics of the student cohort and their predominant beliefs.}},
author = {{Kuklinski, Christiane and Leis, Elena and Liebendörfer, Michael and Hochmuth, Reinhard and Biehler, Rolf and Lankeit, Elisa and Neuhaus, Silke and Schaper, Niclas and Schürmann, Mirko}},
booktitle = {{Proceedings of the Second Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2018, 5-7 April 2018)}},
editor = {{Durand-Guerrier, V. and Hochmuth, R. and Goodchild, S. and Hogstad, N.M.}},
keywords = {{Beliefs., Motivational developments, Novel approaches to teaching, Teacher education, Transition to and across university mathematics}},
pages = {{527--536}},
publisher = {{INDRUM Network, University of Agder}},
title = {{{Evaluating Innovative Measures in University Mathematics – The Case of Affective Outcomes in a Lecture focused on Problem-Solving}}},
year = {{2018}},
}
@book{37541,
editor = {{Weber, Jutta and Bublitz, Hannelore and von Bose, Käthe and Fuchs, Matthias}},
publisher = {{Wilhelm Fink}},
title = {{{Körper, Materialitäten, Technologien}}},
year = {{2018}},
}
@misc{37546,
booktitle = {{Transfers. International Journal for Mobility Studies}},
editor = {{Weber, Jutta and Kröger, Fabian}},
number = {{Spring 2018}},
title = {{{Degendering the Driver? Special Issue of ‚Transfers. International Journal for Mobility Studies‘, Vol. 8(1)}}},
year = {{2018}},
}
@inbook{34623,
author = {{Alpsancar, Suzana}},
booktitle = {{Unterwachen und Schlafen. Anthropophile Medien nach dem Interface}},
editor = {{Andreas, Michael and Kasprowicz, Dawid and Rieger, Stefan}},
pages = {{105--132}},
publisher = {{Meson}},
title = {{{Wer handelt mit unsichtbaren Schnittstellen? }}},
doi = {{10.14619/1358}},
year = {{2018}},
}
@article{28981,
abstract = {{What does it mean to explain data patterns? Cognitive psychologists and other scientists face this question when observable phenomena have to be explained in theoretical terms. Frequentist null-hypothesis testing – one prominent approach in psychology – controls error rates. Machine learning – an alternative prominent outside of, but not yet inside psychology – focuses on precise predictions. However, both alternatives often provide little insight into the data. We propose a combination of formal modeling and Bayesian statistical inference to ground explanations in data analysis. We support this approach by reference to philosophy of science and discussions of the current methods crisis in several empirical sciences and illustrate it with an example from visual attention research.}},
author = {{Krüger, Alexander and Tünnermann, Jan and Rohlfing, Katharina and Scharlau, Ingrid}},
journal = {{Archives of Data Science, Series A}},
pages = {{1 -- 27}},
title = {{{Quantitative Explanation as a Tight Coupling of Data, Model, and Theory}}},
doi = {{10.5445/KSP/1000087327/10}},
volume = {{5}},
year = {{2018}},
}
@misc{35458,
author = {{Alpsancar, Suzana}},
booktitle = {{BTU News - September 2018}},
number = {{52}},
pages = {{12--13}},
title = {{{Die Ethik der Künstlichen Intelligenz}}},
year = {{2018}},
}
@article{34622,
abstract = {{Ropohl plädiert in seiner Technikphilosophie für eine bewusste Gestaltung des technischen Wandels, in dem auch die Ingenieur*innen in die Pflicht genommen werden. In meiner Rekonstruktion zeige ich, dass Ropohls normative Grundorientierung in einer Zeitdiagnose fußt, die er allerdings nicht expliziert. Aus seinem Beispiel ziehe ich die These, dass jeder Theorie der Technikfolgenabschätzung (TA) notwendig eine historisch-normative Signatur eingeschrieben ist. Um eine kritische Auseinandersetzung über das Selbstverständnis und den Zweck von TA zu führen, gilt es, anders als Ropohl, auch die inhärenten Zeitdiagnosen sichtbar zu machen und zu diskutieren.}},
author = {{Alpsancar, Suzana}},
issn = {{2567-8833}},
journal = {{TATuP - Zeitschrift für Technikfolgenabschätzung in Theorie und Praxis}},
keywords = {{General Medicine}},
number = {{1}},
pages = {{14--20}},
publisher = {{Oekom Publishers GmbH}},
title = {{{Technikfolgenabschätzung als Zeitdiagnose}}},
doi = {{10.14512/tatup.27.1.14}},
volume = {{27}},
year = {{2018}},
}
@inproceedings{8162,
abstract = {{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.}},
author = {{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}},
booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}},
editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}},
keywords = {{search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}},
location = {{Liverpool, UK}},
pages = {{38:1--38:16}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{On Efficiently Solvable Cases of Quantum k-SAT}}},
doi = {{10.4230/LIPIcs.MFCS.2018.38}},
volume = {{117}},
year = {{2018}},
}
@inproceedings{8161,
abstract = {{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.}},
author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}},
booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}},
editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}},
keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}},
location = {{Liverpool, UK}},
pages = {{58:1--58:16}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}},
doi = {{10.4230/LIPIcs.MFCS.2018.58}},
volume = {{117}},
year = {{2018}},
}
@inproceedings{8160,
abstract = {{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.}},
author = {{Gharibian, Sevag and Yirka, Justin}},
booktitle = {{12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}},
editor = {{Wilde, Mark}},
keywords = {{Complexity theory, Quantum Merlin Arthur (QMA), local Hamiltonian, local measurement, spectral gap}},
location = {{Paris, France}},
pages = {{2:1--2:17}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{The Complexity of Simulating Local Measurements on Quantum Systems}}},
doi = {{10.4230/LIPIcs.TQC.2017.2}},
volume = {{73}},
year = {{2018}},
}
@article{8167,
author = {{Gharibian, Sevag and Sikora, Jamie}},
issn = {{1942-3454}},
journal = {{ACM Transactions on Computation Theory (TOCT)}},
keywords = {{Local Hamiltonian, ground state connectivity, quantum Hamiltonian complexity, reconfiguration problem}},
number = {{2}},
pages = {{8:1--8:28}},
publisher = {{ACM}},
title = {{{Ground State Connectivity of Local Hamiltonians}}},
doi = {{10.1145/3186587}},
volume = {{10}},
year = {{2018}},
}