"Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs."

Nicola Galesi et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2019.49

access: open

type: Conference or Workshop Paper

metadata version: 2019-08-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/GalesiIRS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/GalesiIRS19
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. MFCS 2019: 49:1-49: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.