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,...

Descripció completa

Dades bibliogràfiques
Autor principal:	Herrera Poyatos, A
Altres autors:	Goldberg, L
Format:	Thesis
Idioma:	English
Publicat:	2023
Matèries:	Computational complexity

Ítems similars

On the complexity of counting homomorphisms under surjectivity constraints
per: Focke, J
Publicat: (2020)

The complexity of approximately counting retractions to square-free graphs
per: Focke, J, et al.
Publicat: (2021)

The complexity of approximating the complex-valued Potts model
per: Galanis, A, et al.
Publicat: (2022)

Approximate cycles count in undirected graphs
per: Maytham Safar, et al.
Publicat: (2014-04-01)

Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
per: Branislav Rehak, et al.
Publicat: (2022-01-01)

Approximate Counting via the Poisson-Laplace-Mellin Method
per: Michael Fuchs, et al.
Publicat: (2012-01-01)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
per: Galanis, A, et al.
Publicat: (2022)

Counting Independent Sets Using the Bethe Approximation
per: Chandrasekaran, Venkat, et al.
Publicat: (2011)

Scalable Spectral Clustering With Nyström Approximation: Practical and Theoretical Aspects
per: Farhad Pourkamali-Anaraki
Publicat: (2020-01-01)

The complexity of approximately counting retractions
per: Focke, J, et al.
Publicat: (2020)

The complexity of approximately counting retractions
per: Focke, J, et al.
Publicat: (2019)

Complex approximation /
per: Aupetit, Bernard, et al.
Publicat: (1980)

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
per: Zoe Leyva-Acosta, et al.
Publicat: (2024-09-01)

Computational and approximate solutions of complex nonlinear Fokas–Lenells equation arising in optical fiber
per: Mostafa M.A. Khater, et al.
Publicat: (2021-06-01)

Complexity Hierarchies and Higher-order Cons-free Term Rewriting
per: Cynthia Kop, et al.
Publicat: (2017-08-01)

An overview on polynomial approximation of NP-hard problems
per: Paschos Vangelis Th.
Publicat: (2009-01-01)

Optimal estimatiopn in approximation theory
per: 315787 Michelli, Charles A., et al.
Publicat: (1977)

Faster exponential-time algorithms for approximately counting independent sets
per: Goldberg, L, et al.
Publicat: (2021)

List Approximation for Increasing Kolmogorov Complexity
per: Marius Zimand
Publicat: (2021-12-01)

ESTIMATION OF SOFTWARE COMPLEXITY OF CALCULATION OF AUTOREGRESSION COEFFICIENTS AT DIGITAL SPECTRAL ANALYSIS
per: Andrey Zuev, et al.
Publicat: (2022-03-01)

Interpolation and approximation by rational functions in the complex domain /
per: 349555 Walsh, J. L.
Publicat: (1969)

Complexity explained /
per: 298158
Publicat: (2008)

Microwave Synthesis Under Solvent-Free Conditions and Spectral Studies of Some Mesoporphyrinic Complexes
per: Rica Boscencu
Publicat: (2012-05-01)

Descriptive Complexity for Counting Complexity Classes
per: Marcelo Arenas, et al.
Publicat: (2020-02-01)

Information-based complexity /
per: Traub, J. F. (Joseph Frederick), 1932-, et al.
Publicat: (1988)

(Hyper)Graph Embedding and Classification via Simplicial Complexes
per: Alessio Martino, et al.
Publicat: (2019-10-01)

Aluminium(I) anion-supported zero-valent palladium complexes
per: Yan, Chenting, et al.
Publicat: (2024)

Complex Noise-Resistant Zeroing Neural Network for Computing Complex Time-Dependent Lyapunov Equation
per: Bolin Liao, et al.
Publicat: (2022-08-01)

Separating quantum communication and approximate rank
per: Anshu, Anurag, et al.
Publicat: (2018)

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
per: Hubie Chen, et al.
Publicat: (2013-03-01)

The computational complexity of algebraic and numeric problems /
per: 306616 Borodin, Allan, et al.
Publicat: (1975)

Theory of Complexity: Definitions, Models, and Applications /
per: Lopez-Ruiz, Ricardo, editor
Publicat: (2021)

Computational complexity : a modern approach /
per: 440361 Arora, Sanjeev, et al.
Publicat: (2009)

Automata, computability and complexity : theory and applications /
per: 233695 Rich, Elaine
Publicat: (2008)

Computational complexity : a quantitative perspective /
per: 434047 Zimand, Marius
Publicat: (2004)

Complexity and cryptography : an introduction /
per: 415062 Talbot, John, et al.
Publicat: (2006)

Zero-inflated regression models with an application to vehicle theft count data
per: Zulkifli, Malina, et al.
Publicat: (2012)

Approximability results for the $p$-centdian and the converse centdian problems
per: Yen Hung Chen
Publicat: (2022-11-01)

Uncertainty and surprise in complex systems : questions on working with the unexpected /
per: McDaniel, Reuben R., et al.
Publicat: (2005)

Computational complexity of vector maximisation over discrete sets/
per: 236988 Walker, John
Publicat: (1995)