- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Lower Bounds for QCDCL via Formula Gauge ; volume:67 ; number:4 ; day:27 ; month:9 ; year:2023 ; pages:1-25 ; date:12.2023
Journal of automated reasoning ; 67, Heft 4 (27.9.2023), 1-25, 12.2023
- Creator
-
Böhm, Benjamin
Beyersdorff, Olaf
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10817-023-09683-1
- URN
-
urn:nbn:de:101:1-2024022611175551085837
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Böhm, Benjamin
- Beyersdorff, Olaf
- SpringerLink (Online service)
Other Objects (12)
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
Proportionality’s Lower Bound
Metrics on Dynamic Graphs (and lower bounds via Zigzag Persistence)
Approximate degree and quantum query lower bounds via dual polynomials
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Lower mass bounds on FIMP dark matter produced via freeze-in
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
Proportionality’s Lower Bound
Metrics on Dynamic Graphs (and lower bounds via Zigzag Persistence)
Approximate degree and quantum query lower bounds via dual polynomials
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Lower mass bounds on FIMP dark matter produced via freeze-in
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
Proportionality’s Lower Bound
Metrics on Dynamic Graphs (and lower bounds via Zigzag Persistence)
Approximate degree and quantum query lower bounds via dual polynomials
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Lower mass bounds on FIMP dark matter produced via freeze-in
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials