The complexity of computing second solutions

DOI10.4230/LIPICS.MFCS.2025.43MaRDI QIDQ7310212zbMATH OpenFDO

Authors Fabian Egidy, Christian Glaßer, Fynn Godau

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.43

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey of one-way functions in complexity theory
• A taxonomy of complexity classes of functions
• Computation times of NP sets of different densities
• Computing Solutions Uniquely Collapses the Polynomial Hierarchy
• scientific article; zbMATH DE number 1332676 (Why is no real title available?)
• scientific article; zbMATH DE number 7559398 (Why is no real title available?)
• On Isomorphisms and Density of NP and Other Complete Sets
• On total functions, existence theorems and computational complexity
• Oracles That Compute Values
• P-Printable Sets
• Sparse sets in NP-P: EXPTIME versus NEXPTIME
• TFNP: an update
• The complexity of optimization problems
• Theory of Computational Complexity

This page was built for publication: The complexity of computing second solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310212)