Scheder , D., & Steinberger, J. (2024). PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster. Computational Complexity, 33(2). https://doi.org/10.1007/s00037-024-00259-y
ISO-690 (author-date, English)SCHEDER , Dominik und STEINBERGER, John, 2024. PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster. computational complexity. 1 Dezember 2024. Vol. 33, no. 2, . DOI 10.1007/s00037-024-00259-y.
Modern Language Association 9th editionScheder , D., und J. Steinberger. „PPSZ for General K-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster“. Computational Complexity, Bd. 33, Nr. 2, Dezember 2024, https://doi.org/10.1007/s00037-024-00259-y.
Mohr Siebeck - Recht (Deutsch - Österreich)Scheder , Dominik/Steinberger, John: PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster, computational complexity 2024,
Emerald - HarvardScheder , D. und Steinberger, J. (2024), „PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster“, Computational Complexity, Vol. 33 No. 2, verfügbar unter:https://doi.org/10.1007/s00037-024-00259-y.