Approximate counting via complex zero-free regions and spectral independence

Approximate counting via complex zero-free regions and spectral independence

<p>This thesis investigates fundamental problems in approximate counting that arise in the field of statistical mechanics. Building upon recent advancements in the area, our research aims to enhance our understanding of the computational complexity of sampling from the Ising and Potts models,...

Полное описание

Библиографические подробности
Главный автор:	Herrera Poyatos, A
Другие авторы:	Goldberg, L
Формат:	Диссертация
Язык:	English
Опубликовано:	2023
Предметы:	Computational complexity

Схожие документы

On the complexity of counting homomorphisms under surjectivity constraints
по: Focke, J
Опубликовано: (2020)

The complexity of approximately counting retractions to square-free graphs
по: Focke, J, и др.
Опубликовано: (2021)

The complexity of approximating the complex-valued Potts model
по: Galanis, A, и др.
Опубликовано: (2022)

Approximate cycles count in undirected graphs
по: Maytham Safar, и др.
Опубликовано: (2014-04-01)

Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
по: Branislav Rehak, и др.
Опубликовано: (2022-01-01)

Approximate Counting via the Poisson-Laplace-Mellin Method
по: Michael Fuchs, и др.
Опубликовано: (2012-01-01)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
по: Galanis, A, и др.
Опубликовано: (2022)

Counting Independent Sets Using the Bethe Approximation
по: Chandrasekaran, Venkat, и др.
Опубликовано: (2011)

Scalable Spectral Clustering With Nyström Approximation: Practical and Theoretical Aspects
по: Farhad Pourkamali-Anaraki
Опубликовано: (2020-01-01)

The complexity of approximately counting retractions
по: Focke, J, и др.
Опубликовано: (2020)

The complexity of approximately counting retractions
по: Focke, J, и др.
Опубликовано: (2019)

Complex approximation /
по: Aupetit, Bernard, и др.
Опубликовано: (1980)

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
по: Zoe Leyva-Acosta, и др.
Опубликовано: (2024-09-01)

Computational and approximate solutions of complex nonlinear Fokas–Lenells equation arising in optical fiber
по: Mostafa M.A. Khater, и др.
Опубликовано: (2021-06-01)

Complexity Hierarchies and Higher-order Cons-free Term Rewriting
по: Cynthia Kop, и др.
Опубликовано: (2017-08-01)

An overview on polynomial approximation of NP-hard problems
по: Paschos Vangelis Th.
Опубликовано: (2009-01-01)

Optimal estimatiopn in approximation theory
по: 315787 Michelli, Charles A., и др.
Опубликовано: (1977)

Faster exponential-time algorithms for approximately counting independent sets
по: Goldberg, L, и др.
Опубликовано: (2021)

List Approximation for Increasing Kolmogorov Complexity
по: Marius Zimand
Опубликовано: (2021-12-01)

ESTIMATION OF SOFTWARE COMPLEXITY OF CALCULATION OF AUTOREGRESSION COEFFICIENTS AT DIGITAL SPECTRAL ANALYSIS
по: Andrey Zuev, и др.
Опубликовано: (2022-03-01)

Interpolation and approximation by rational functions in the complex domain /
по: 349555 Walsh, J. L.
Опубликовано: (1969)

Complexity explained /
по: 298158
Опубликовано: (2008)

Microwave Synthesis Under Solvent-Free Conditions and Spectral Studies of Some Mesoporphyrinic Complexes
по: Rica Boscencu
Опубликовано: (2012-05-01)

Descriptive Complexity for Counting Complexity Classes
по: Marcelo Arenas, и др.
Опубликовано: (2020-02-01)

Information-based complexity /
по: Traub, J. F. (Joseph Frederick), 1932-, и др.
Опубликовано: (1988)

(Hyper)Graph Embedding and Classification via Simplicial Complexes
по: Alessio Martino, и др.
Опубликовано: (2019-10-01)

Aluminium(I) anion-supported zero-valent palladium complexes
по: Yan, Chenting, и др.
Опубликовано: (2024)

Complex Noise-Resistant Zeroing Neural Network for Computing Complex Time-Dependent Lyapunov Equation
по: Bolin Liao, и др.
Опубликовано: (2022-08-01)

Separating quantum communication and approximate rank
по: Anshu, Anurag, и др.
Опубликовано: (2018)

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
по: Hubie Chen, и др.
Опубликовано: (2013-03-01)

The computational complexity of algebraic and numeric problems /
по: 306616 Borodin, Allan, и др.
Опубликовано: (1975)

Theory of Complexity: Definitions, Models, and Applications /
по: Lopez-Ruiz, Ricardo, editor
Опубликовано: (2021)

Computational complexity : a modern approach /
по: 440361 Arora, Sanjeev, и др.
Опубликовано: (2009)

Automata, computability and complexity : theory and applications /
по: 233695 Rich, Elaine
Опубликовано: (2008)

Computational complexity : a quantitative perspective /
по: 434047 Zimand, Marius
Опубликовано: (2004)

Complexity and cryptography : an introduction /
по: 415062 Talbot, John, и др.
Опубликовано: (2006)

Zero-inflated regression models with an application to vehicle theft count data
по: Zulkifli, Malina, и др.
Опубликовано: (2012)

Approximability results for the $p$-centdian and the converse centdian problems
по: Yen Hung Chen
Опубликовано: (2022-11-01)

Uncertainty and surprise in complex systems : questions on working with the unexpected /
по: McDaniel, Reuben R., и др.
Опубликовано: (2005)

Computational complexity of vector maximisation over discrete sets/
по: 236988 Walker, John
Опубликовано: (1995)