Restricted Holant Dichotomy on Domains 3 and 4

07/29/2023
by   Yin Liu, et al.
0

Holant^*(f) denotes a class of counting problems specified by a constraint function f. We prove complexity dichotomy theorems for Holant^*(f) in two settings: (1) f is any arity-3 real-valued function on input of domain size 3. (2) f is any arity-3 {0,1}-valued function on input of domain size 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2020

Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing

We generalize the celebrated isoperimetric inequality of Khot, Minzer, a...
research
05/16/2020

A Dichotomy for Real Boolean Holant Problems

We prove a complexity dichotomy for Holant problems on the boolean domai...
research
11/15/2019

ℓ_∞ Vector Contraction for Rademacher Complexity

We show that the Rademacher complexity of any R^K-valued function class ...
research
11/13/2018

Domain Agnostic Real-Valued Specificity Prediction

Sentence specificity quantifies the level of detail in a sentence, chara...
research
03/11/2022

Data-driven geometric scale detection via Delaunay interpolation

Accurate approximation of a real-valued function depends on two aspects ...
research
05/27/2023

Computing a partition function of a generalized pattern-based energy over a semiring

Valued constraint satisfaction problems with ordered variables (VCSPO) a...
research
04/04/2017

Conical: an extended module for computing a numerically satisfactory pair of solutions of the differential equation for conical functions

Conical functions appear in a large number of applications in physics an...

Please sign up or login with your details

Forgot password? Click here to reset