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). On the Computational Limits of Infinite Satisfaction.
| 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
Sherali-Adams and the binary encoding of combinatorial principles
(2020)
Presentation / Conference Contribution
Resolution and the binary encoding of combinatorial principles
(2019)
Presentation / Conference Contribution
Simplicial Complex Entropy
(2017)
Presentation / Conference Contribution
Sublinear-Time Algorithms for Tournament Graphs
(2009)
Presentation / Conference Contribution
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
(2007)
Presentation / Conference Contribution
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 © 2024
Advanced Search