Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
On the complexity of Hilbert refutations for partition
On the complexity of Hilbert refutations for partition
S. Margulies‚ S. Onn and D. V. Pasechnik
ISSN
0747−7171
Journal
J. Symbolic Comput.
MR Number
3229920
Pages
70–83
Volume
66
Year
2015
Links
BibTeX
DOI
(10.1016/j.jsc.2013.06.005)
See Also
Dmitrii Pasechnik
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top