default search action
"Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation ..."
Amin Coja-Oghlan et al. (2003)
- Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. Electron. Colloquium Comput. Complex. TR03 (2003)
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.