Specification and automatic verification of computational reductions

DOI10.4230/LIPICS.MFCS.2024.56MaRDI QIDQ7241062zbMATH OpenFDO

Authors Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

automatic verificationcomputational reductionsdecidability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Complexity of infinite-domain constraint satisfaction
• Elements of finite model theory.
• Experiments with reduction finding
• Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• Languages that Capture Complexity Classes
• Logic and machines: decision problems and complexity. Proceedings of the Symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen
• The wonderland of reflections

This page was built for publication: Specification and automatic verification of computational reductions

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