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

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awdur:	Herrera Poyatos, A
Awduron Eraill:	Goldberg, L
Fformat:	Traethawd Ymchwil
Iaith:	English
Cyhoeddwyd:	2023
Pynciau:	Computational complexity

Eitemau Tebyg

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

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

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

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

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

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

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

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

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

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

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

Complex approximation /
gan: Aupetit, Bernard, et al.
Cyhoeddwyd: (1980)

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

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

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

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

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

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

List Approximation for Increasing Kolmogorov Complexity
gan: Marius Zimand
Cyhoeddwyd: (2021-12-01)

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

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

Complexity explained /
gan: 298158
Cyhoeddwyd: (2008)

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

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

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

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

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

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

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

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

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

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

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

Automata, computability and complexity : theory and applications /
gan: 233695 Rich, Elaine
Cyhoeddwyd: (2008)

Computational complexity : a quantitative perspective /
gan: 434047 Zimand, Marius
Cyhoeddwyd: (2004)

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

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

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

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

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