Fabian Egidy

According to our database, Fabian Egidy authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Optimal Proof Systems for Complex Sets Are Hard to Find.

Fabian Egidy, Christian Glaßer

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

The Complexity of Computing Second Solutions.

Fabian Egidy, Christian Glaßer, Fynn Godau

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

Oracle without Optimal Proof Systems outside Nondeterministic Subexponential Time.

Fabian Egidy, Christian Glaßer

CoRR, 2024

An Oracle with no UP-Complete Sets, but NP = PSPACE.

David Dingel, Fabian Egidy, Christian Glaßer

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP.

Fabian Egidy, Christian Glaßer, Martin G. Herold

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP.

Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022