"Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas."

Che Cheng et al. (2025)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SAT.2025.10

access: open

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/sat/ChengFJST25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/ChengFJST25
Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan:
Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. SAT 2025: 10:1-10:20

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.