Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Generalising tractable VCSPs d...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
Bibliographic Details
Main Authors:
Kolmogorov, V
,
Živný, S
Format:
Report
Published:
2010
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms
by: Cohen, D, et al.
Published: (2008)
Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms
by: Jeavons, P, et al.
Published: (2006)
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphismsa
by: Cohen, D, et al.
Published: (2008)
A tractable class of binary VCSPs via M-convex intersection
by: Hirai, H, et al.
Published: (2019)
Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
by: Hirai, H, et al.
Published: (2018)