A tractable class of binary VCSPs via M-convex intersection

<p>A binary VCSP is a general framework for the minimization problem of a function represented as the sum of unary and binary cost functions. An important line of VCSP research is to investigate what functions can be solved in polynomial time. Cooper and Živný classified the tractability of bi...

詳細記述

書誌詳細
主要な著者: Hirai, H, Iwamasa, Y, Murota, K, Zivny, S
フォーマット: Journal article
出版事項: Association for Computing Machinery 2019

類似資料