The complexity of conservative valued CSPs

Bibliographic Details
Main Authors: Kolmogorov, V, Živný, S
Format: Journal article
Published: 2013
_version_ 1797085386379362304
author Kolmogorov, V
Živný, S
author_facet Kolmogorov, V
Živný, S
author_sort Kolmogorov, V
collection OXFORD
description
first_indexed 2024-03-07T02:08:15Z
format Journal article
id oxford-uuid:9fb92dee-46a2-4587-b8b1-4effff84b189
institution University of Oxford
last_indexed 2024-03-07T02:08:15Z
publishDate 2013
record_format dspace
spelling oxford-uuid:9fb92dee-46a2-4587-b8b1-4effff84b1892022-03-27T02:00:00ZThe complexity of conservative valued CSPsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:9fb92dee-46a2-4587-b8b1-4effff84b189Department of Computer Science2013Kolmogorov, VŽivný, S
spellingShingle Kolmogorov, V
Živný, S
The complexity of conservative valued CSPs
title The complexity of conservative valued CSPs
title_full The complexity of conservative valued CSPs
title_fullStr The complexity of conservative valued CSPs
title_full_unstemmed The complexity of conservative valued CSPs
title_short The complexity of conservative valued CSPs
title_sort complexity of conservative valued csps
work_keys_str_mv AT kolmogorovv thecomplexityofconservativevaluedcsps
AT zivnys thecomplexityofconservativevaluedcsps
AT kolmogorovv complexityofconservativevaluedcsps
AT zivnys complexityofconservativevaluedcsps