Quantified Boolean Formulas: (Solving and) Proof Complexity

Mahajan, M. (2023). Quantified Boolean Formulas: (Solving and) Proof Complexity: (Solving and) Proof Complexity.

Type

Web resource

Intellectual base

Web

Year

2023

Link

https://bpb-us-e2.wpmucdn.com/sites.uci.edu/dist/c/4816/files/2023/03/Meena-ASL23.pdf

Cited by

1 citation across 1 artifact.

Domain-specific

• Formula Game
  • Consequently, the closed QBF is true if and only if E has a winning strategy.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:788c8bc07f53 · see in the full table