@inproceedings{62047,
  author       = {{Reckmann, Eileen and Temmen, Katrin}},
  location     = {{Hannover}},
  title        = {{{Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}}},
  year         = {{2024}},
}

@article{48484,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Previous research indicates that performing passes with a head fake in basketball leads to increased response initiation times and errors as compared to performing a pass without a head fake. These so-called fake production costs only occurred when not given the time to mentally prepare the deceptive movement. In the current study, we investigated if extensive practice could reduce the cognitive costs of producing a pass with head fake. Twenty-four basketball novices participated in an experiment on five consecutive days. A visual cue prompted participants to play a pass with or without a head fake either to the left or right side. The cued action had to be executed after an interstimulus interval (ISI) of either 0 ms, 400 ms, 800 ms or 1200 ms, allowing for different movement preparation times. Results indicated higher response initiation times (ITs) and error rates (ERs) for passes with head fakes for the short preparation intervals (ISI 0 ms and 400 ms) on the first day but no difference for the longer preparation intervals (ISI 800 ms and 1200 ms). After only one day of practice, participants showed reduced fake production costs (for ISI 0 ms) and were even able to eliminate these cognitive costs when given time to mentally prepare the movement (for ISI 400 ms). Accordingly, physical practice can reduce the cognitive costs associated with head-fake generation. This finding is discussed against the background of the strengthening of stimulus response associations.</jats:p>}},
  author       = {{Böer, Nils Tobias and Weigelt, Matthias and Schütz, Christoph and Güldenpenning, Iris}},
  issn         = {{0340-0727}},
  journal      = {{Psychological Research}},
  keywords     = {{Arts and Humanities (miscellaneous), Developmental and Educational Psychology, Experimental and Cognitive Psychology, General Medicine}},
  pages        = {{523--534}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Practice reduces the costs of producing head fakes in basketball}}},
  doi          = {{10.1007/s00426-023-01885-x}},
  volume       = {{88}},
  year         = {{2024}},
}

@inproceedings{50273,
  abstract     = {{The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical
complexity theory, with applications spanning randomized computation to circuit
lower bounds to ''quantum advantage'' analyses for near-term quantum computers.
Quantumly, however, despite the fact that at least \emph{four} definitions of
quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for
these of even basic facts from $\mathsf{PH}$. This work studies three
quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from
[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings
($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one
of which is new to this work, utilizing quantum pure states
($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from
[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for
$\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided
error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating
these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq
\mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$.}},
  author       = {{Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}},
  booktitle    = {{Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}},
  number       = {{7}},
  pages        = {{7--17}},
  title        = {{{Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds}}},
  doi          = {{10.4230/LIPIcs.MFCS.2024.7}},
  volume       = {{306}},
  year         = {{2024}},
}