"Computationally Hard Problems Are Hard for QBF Proof Systems Too."

Agnes Schleitzer, Olaf Beyersdorff (2025)

Details and statistics

DOI: 10.1609/AAAI.V39I11.33233

access: open

type: Conference or Workshop Paper

metadata version: 2025-04-17

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.