Dorian Rudolph, M.Sc.

Research Associate

Office Address:
Pohlweg 51
33098 Paderborn
Room:
O4.131

Publications

Latest Publications

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem

M. Aldi, S. Gharibian, D. Rudolph, in: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 2026, p. 7:1-7:24.



Verification Complexity and Extension of Classical Shadows

G. Karaiskos, A. Raza, D. Rudolph, D.E. Koh, S. Gharibian, ArXiv:2609.40107 (2026).


A physical and universal model of bosonic computations with Solovay-Kitaev theorem

D. Rudolph, A. Motamedi, D. Sambrani, H. Reza Naeij, U. Chabaud, S. Gharibian, S. Mehraban, (n.d.).


How hard is it to verify a classical shadow?

G. Karaiskos, D. Rudolph, J.J. Meyer, J. Eisert, S. Gharibian, in: International Colloquium on Automata, Languages, and Programming (ICALP), 2026, pp. 1–23.


Show all publications