Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
On the Computational Limits of Infinite Satisfaction.
Dantchev, Stefan; Valencia, Frank
Authors
Frank Valencia
Citation
Dantchev, S., & Valencia, F. (2005, March). On the Computational Limits of Infinite Satisfaction. Presented at The 20th Annual ACM Symposium on Applied Computing, Santa Fe, USA
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | The 20th Annual ACM Symposium on Applied Computing |
| Publication Date | 2005-03 |
| Pages | 393-397 |
| Public URL | https://durham-repository.worktribe.com/output/1695097 |
You might also like
Depth lower bounds in Stabbing Planes for combinatorial principles
(2024)
Journal Article
Relativization makes contradictions harder for Resolution
(2013)
Journal Article
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
(2012)
Journal Article
Cutting Planes and the Parameter Cutwidth
(2012)
Journal Article
Parameterized Proof Complexity
(2011)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search