An approximation trichotomy for Boolean #CSP

An approximation trichotomy for Boolean #CSP

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид:	Dyer, M, Goldberg, L, Jerrum, M
Формат:	Journal article
Хэвлэсэн:	2010

Ижил төстэй зүйлс

The Complexity of Weighted Boolean CSP
-н: Dyer, M, зэрэг
Хэвлэсэн: (2009)

A complexity trichotomy for approximately counting list H-colourings
-н: Galanis, A, зэрэг
Хэвлэсэн: (2017)

A complexity trichotomy for approximately counting list H-colourings
-н: Goldberg, L, зэрэг
Хэвлэсэн: (2016)

The trichotomy of the Tibetan subject
-н: Wang, Zhijing
Хэвлэсэн: (2024)

The complexity of counting locally maximal satisfying assignments of Boolean CSPs
-н: Goldberg, L, зэрэг
Хэвлэсэн: (2016)

Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
-н: Brand, C, зэрэг
Хэвлэсэн: (2018)

Fine-grained dichotomies for the Tutte plane and Boolean #CSP
-н: Roth, M, зэрэг
Хэвлэсэн: (2017)

Approximating pairwise correlations in the Ising model
-н: Goldberg, L, зэрэг
Хэвлэсэн: (2019)

Approximating the partition function of the ferromagnetic potts model
-н: Goldberg, L, зэрэг
Хэвлэсэн: (2012)

Approximately counting H-colourings is BIS-Hard
-н: Galanis, A, зэрэг
Хэвлэсэн: (2015)

Approximately counting H-colourings is #BIS-hard
-н: Galanis, A, зэрэг
Хэвлэсэн: (2016)

Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
-н: Galanis, A, зэрэг
Хэвлэсэн: (2017)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
-н: Galanis, A, зэрэг
Хэвлэсэн: (2020)

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
-н: Backens, M, зэрэг
Хэвлэсэн: (2019)

Approximating the noise sensitivity of a monotone Boolean function
-н: Rubinfeld, Ronitt, зэрэг
Хэвлэсэн: (2022)

Over−Approximating Boolean Programs with Unbounded Thread Creation
-н: Cook, B, зэрэг
Хэвлэсэн: (2006)

Low-rank Boolean matrix approximation by integer programming
-н: Kovacs, R, зэрэг
Хэвлэсэн: (2018)

Approximating the noise sensitivity of a monotone Boolean function
Хэвлэсэн: (2021)

Approximate counting CSP seen from the other side
-н: Bulatov, A, зэрэг
Хэвлэсэн: (2020)

Approximate counting CSP seen from the other side
-н: Bulatov, A, зэрэг
Хэвлэсэн: (2019)

Approximate homomorphisms between the Boolean cube and groups of prime order
-н: Sanders, T
Хэвлэсэн: (2018)

Approximating the influence of monotone boolean functions in O(√n) query complexity
-н: Ron, Dana, зэрэг
Хэвлэсэн: (2012)

Random walks on small world networks
-н: Dyer, ME, зэрэг
Хэвлэсэн: (2020)

A complexity classification of spin systems with an external field
-н: Goldberg, L, зэрэг
Хэвлэсэн: (2015)

Boolean Mereology
-н: Wu, Xinhe
Хэвлэсэн: (2022)

Boolean Classes
-н: McAllester, David, зэрэг
Хэвлэсэн: (2004)

CSP files
-н: Roscoe, T, зэрэг
Хэвлэсэн: (2011)

Iterated Boolean games
-н: Gutierrez, J, зэрэг
Хэвлэсэн: (2015)

Iterated Boolean games
-н: Gutierrez, J, зэрэг
Хэвлэсэн: (2013)

Boolean Hedonic Games
-н: Aziz, H, зэрэг
Хэвлэсэн: (2016)

Probabilistic representation and manipulation of Boolean functions using free Boolean diagrams
-н: Shen, Amelia H. (Amelia Huimin)
Хэвлэсэн: (2006)

On the expressiveness of CSP
-н: Roscoe, A
Хэвлэсэн: (2011)

Taking quotients in CSP
-н: Goldsmith, M
Хэвлэсэн: (2006)

The complexity of Boolean functions /
-н: 180167 Wegener, Ingo
Хэвлэсэн: (1987)

Pseudo-Boolean programming and applications /
-н: 373653 Ivanescu, Petru L.
Хэвлэсэн: (1965)

Characterising the manipulability of Boolean games
-н: Harrenstein, BP, зэрэг
Хэвлэсэн: (2017)

Incentive Engineering for Boolean Games.
-н: Endriss, U, зэрэг
Хэвлэсэн: (2011)

CSP202-CSP204 - PENGKOMPUTERAN SAINTIFIK - APRIL 1987.
-н: PPSKOM, Pusat Pengajian Sains Komputer
Хэвлэсэн: (1987)

Tyger: A Tool for Automatically Simulating CSP−Like Languages in CSP
-н: Gibson−Robinson, T
Хэвлэсэн: (2010)

Unbounded nondeterminism in CSP
-н: Roscoe, A, зэрэг
Хэвлэсэн: (1989)