Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Admissions
Research
(current)
News & Events
About Us
Alumni
Our Students
Innovation
Home
Research
Publications
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
C. Viola and S. Živný
Abstract
PDF (MFCS)
Annote
An extended abstract appeared in Proceedings of MFCS'20.
Year
2020
Links
BibTeX
Link
See Also
Caterina Viola
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data and Knowledge
Human Centered Computing
Programming Languages
Quantum
Security
Systems
Back to Top