"Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through ..."

Olaf Beyersdorff et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2024.27

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/BeyersdorffHKS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BeyersdorffHKS24
Olaf Beyersdorff, Tim Hoffmann, Kaspar Kasche, Luc Nicolas Spachmann:
Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree. MFCS 2024: 27:1-27:15

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.