Exchange with Claude Opus 4.6 towards proving NP-completeness of the Pseudo-Closed Family problem (PCF)

Zenodo (CERN European Organization for Nuclear Research) 2026 Open access

Read full text
Authors: Sebastian Rudolph
DOI: 10.5281/zenodo.20307509
Cited by: 1

Abstract

This dataset contains supplementary information regarding the paper Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) by Sebastian Rudolph, published at CONCEPTS'26.

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
20 May 2026
Language
EN