On the public citation graph
Polynomial-Time Approximation Algorithms for the Ising Model
0 signed · 487 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-0323-0openalex-snapshot
Algorithms for Random Generation and Counting: A Markov Chain Approach
inferredcites →https://doi.org/10.1007/bf01010403openalex-snapshot
Two-dimensional monomer-dimer systems are computationally intractable
inferredcites →https://doi.org/10.1007/bf02980577openalex-snapshot
Beitrag zur Theorie des Ferromagnetismus
inferredcites →https://doi.org/10.1016/0020-0190(82)90139-9openalex-snapshot
Some observations on the probabilistic algorithms and NP-hard problems
inferredcites →https://doi.org/10.1016/0095-8956(89)90029-4openalex-snapshot
Isoperimetric numbers of graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
inferredcites →https://doi.org/10.1017/s0963548300000390openalex-snapshot
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
inferredcites →https://doi.org/10.1063/1.1703953openalex-snapshot
Dimer Statistics and Phase Transitions
inferredcites →https://doi.org/10.1063/1.1704825openalex-snapshot
On the Dimer Solution of Planar Ising Models
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1088/0305-4470/15/10/028openalex-snapshot
On the computational complexity of Ising spin glass models
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0743744-xopenalex-snapshot
Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
inferredcites →https://doi.org/10.1103/revmodphys.25.353openalex-snapshot
On the Theory of the Ising Model of Ferromagnetism
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/102782.102783openalex-snapshot
A random polynomial-time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1214/aoap/1177005980openalex-snapshot
Geometric Bounds for Eigenvalues of Markov Chains
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1098-2418(200101)18:1<1::aid-rsa1>3.0.co;2-7openalex-snapshot
Coupling vs. conductance for the Jerrum-Sinclair chain
inferred← citeshttps://doi.org/10.1002/rsa.10090openalex-snapshot
The computational complexity of two‐state spin systems
inferred← citeshttps://doi.org/10.1002/rsa.20276openalex-snapshot
Rapid mixing of Gibbs sampling on graphs that are sparse on average
inferred← citeshttps://doi.org/10.1002/rsa.20569openalex-snapshot
Mixing of the Glauber dynamics for the ferromagnetic Potts model
inferred← citeshttps://doi.org/10.1002/rsa.20830openalex-snapshot
Rapid mixing of hypergraph independent sets
inferred← citeshttps://doi.org/10.1002/rsa.20839openalex-snapshot
An optimal (ϵ,δ)‐randomized approximation scheme for the mean of random variables with bounded relative variance
inferred← citeshttps://doi.org/10.1002/rsa.20858openalex-snapshot
Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
inferred← citeshttps://doi.org/10.1002/rsa.20928openalex-snapshot
Tight bounds for popping algorithms
inferred← citeshttps://doi.org/10.1002/rsa.21089openalex-snapshot
Sampling from the low temperature Potts model through a Markov chain on flows
inferred← citeshttps://doi.org/10.1002/rsa.21131openalex-snapshot
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
inferred← citeshttps://doi.org/10.1002/rsa.21135openalex-snapshot
Smoothed counting of 0–1 points in polyhedra
inferred← citeshttps://doi.org/10.1002/rsa.21191openalex-snapshot
Spatial mixing and the random‐cluster dynamics on lattices
inferred← citeshttps://doi.org/10.1002/rsa.3240060409openalex-snapshot
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
inferred← citeshttps://doi.org/10.1002/rsa.70038openalex-snapshot
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded‐Degree Graphs
inferred← citeshttps://doi.org/10.1007/11830924_27openalex-snapshot
The Effect of Boundary Conditions on Mixing Rates of Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_23openalex-snapshot
On Logarithmic Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_9openalex-snapshot
Graph Polynomials and Their Applications I: The Tutte Polynomial
inferred← citeshttps://doi.org/10.1007/978-1-4612-0801-3_4openalex-snapshot
Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4612-1704-6_1openalex-snapshot
Convergence Rates for Monte Carlo Experiments
inferred← citeshttps://doi.org/10.1007/978-1-4757-6594-6_14openalex-snapshot
Combinatorial Optimization, Cross-Entropy, Ants and Rare Events
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_750openalex-snapshot
Approximating the Partition Function of Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_135openalex-snapshot
The Computational Complexity of Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_11openalex-snapshot
Brain Computation: A Computer Science Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_68openalex-snapshot
Rapid Mixing of Several Markov Chains for a Hard-Core Model
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_42openalex-snapshot
A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_67openalex-snapshot
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_66openalex-snapshot
Multisampling: A New Approach to Uniform Sampling and Approximate Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_23openalex-snapshot
Some Problems on Approximate Counting in Graphs and Matroids
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_33openalex-snapshot
Approximately Counting Embeddings into Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_22openalex-snapshot
Sparse Reliable Graph Backbones
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_34openalex-snapshot
Approximating the Partition Function of the Ferromagnetic Potts Model
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_44openalex-snapshot
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_45openalex-snapshot
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_36openalex-snapshot
The Computational Complexity of Estimating MCMC Convergence Time
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_750-1openalex-snapshot
Approximating the Partition Function of Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_30openalex-snapshot
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_44openalex-snapshot
Improved FPTAS for Multi-spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-09444-0_4openalex-snapshot
Relaxation Times of Markov Chains in Statistical Mechanics and Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_4openalex-snapshot
Mathematical Foundations of the Markov Chain Monte Carlo Method
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_65openalex-snapshot
FPTAS for Weighted Fibonacci Gates and Its Applications
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf02175556openalex-snapshot
On the two-dimensional stochastic Ising model in the phase coexistence region near the critical point
inferred← citeshttps://doi.org/10.1007/bf02183384openalex-snapshot
The computational complexity of generating random fractals
inferred← citeshttps://doi.org/10.1007/bf02183743openalex-snapshot
Approximating the number of monomer-dimer coverings of a lattice
inferred← citeshttps://doi.org/10.1007/bf02187060openalex-snapshot
On the two-dimensional dynamical Ising model in the phase coexistence region
inferred← citeshttps://doi.org/10.1007/bfb0054330openalex-snapshot
Analyzing Glauber dynamics by comparison of Markov chains
inferred← citeshttps://doi.org/10.1007/s00037-017-0162-2openalex-snapshot
The Complexity of Approximating complex-valued Ising and Tutte partition functions
inferred← citeshttps://doi.org/10.1007/s00037-021-00218-xopenalex-snapshot
The complexity of approximating the complex-valued Potts model
inferred← citeshttps://doi.org/10.1007/s00037-022-00226-5openalex-snapshot
Zeros and approximations of Holant polynomials on the complex plane
inferred← citeshttps://doi.org/10.1007/s00037-023-00237-wopenalex-snapshot
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory
inferred← citeshttps://doi.org/10.1007/s00220-012-1460-9openalex-snapshot
Critical Ising on the Square Lattice Mixes in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s00220-016-2787-4openalex-snapshot
On Complexity of the Quantum Ising Model
inferred← citeshttps://doi.org/10.1007/s00224-020-09983-8openalex-snapshot
Dichotomy for Holant∗ Problems on the Boolean Domain
inferred← citeshttps://doi.org/10.1007/s00440-004-0369-4openalex-snapshot
Glauber dynamics on trees and hyperbolic graphs
inferred← citeshttps://doi.org/10.1007/s00440-006-0003-8openalex-snapshot
Faster Mixing and Small Bottlenecks
inferred← citeshttps://doi.org/10.1007/s00440-006-0029-yopenalex-snapshot
Stein’s method for concentration inequalities
inferred← citeshttps://doi.org/10.1007/s00440-007-0131-9openalex-snapshot
On the hardness of sampling independent sets beyond the tree threshold
inferred← citeshttps://doi.org/10.1007/s00440-016-0718-0openalex-snapshot
Universality of the mean-field for the Potts model
inferred← citeshttps://doi.org/10.1007/s00440-019-00928-yopenalex-snapshot
Algorithmic Pirogov-Sinai theory
inferred← citeshttps://doi.org/10.1007/s00440-023-01257-xopenalex-snapshot
Geometric bounds on the fastest mixing Markov chain
inferred← citeshttps://doi.org/10.1007/s00440-024-01289-xopenalex-snapshot
On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
inferred← citeshttps://doi.org/10.1007/s00453-003-1073-yopenalex-snapshot
The Relative Complexity of Approximate Counting Problems
inferred← citeshttps://doi.org/10.1007/s00778-016-0437-2openalex-snapshot
Incremental knowledge base construction using DeepDive
inferred← citeshttps://doi.org/10.1007/s10955-014-0947-5openalex-snapshot
Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s10955-014-1016-9openalex-snapshot
A Binomial Approximation Method for the Ising Model
inferred← citeshttps://doi.org/10.1007/s10955-016-1572-2openalex-snapshot
The Worm Process for the Ising Model is Rapidly Mixing
inferred← citeshttps://doi.org/10.1007/s10955-018-2199-2openalex-snapshot
The Ising Partition Function: Zeros and Deterministic Approximation
inferred← citeshttps://doi.org/10.1007/s10955-021-02831-0openalex-snapshot
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
inferred← citeshttps://doi.org/10.1007/s11128-012-0368-9openalex-snapshot
Hitting time of quantum walks with perturbation
inferred← citeshttps://doi.org/10.1007/s11222-016-9685-7openalex-snapshot
Approximate computations for binary Markov random fields and their use in Bayesian models
inferred← citeshttps://doi.org/10.1007/s11265-010-0505-6openalex-snapshot
Min-max Extrapolation Scheme for Fast Estimation of 3D Potts Field Partition Functions. Application to the Joint Detection-Estimation of Brain Activity in fMRI
inferred← citeshttps://doi.org/10.1007/s42081-019-00065-9openalex-snapshot
Cluster analysis of spatial point patterns: posterior distribution of parents inferred from offspring
inferred← citeshttps://doi.org/10.1016/0166-218x(95)e0111-3openalex-snapshot
A new approach to solving three combinatorial enumeration problems on planar graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50039-7openalex-snapshot
10.1016/b978-044488002-4/50039-7
inferred← citeshttps://doi.org/10.1016/j.aam.2011.02.004openalex-snapshot
The Tutte–Potts connection in the presence of an external magnetic field
inferred← citeshttps://doi.org/10.1016/j.aop.2013.11.001openalex-snapshot
Low depth quantum circuits for Ising models
inferred← citeshttps://doi.org/10.1016/j.bpj.2023.12.021openalex-snapshot
Efficient enumeration and visualization of helix-coil ensembles
inferred← citeshttps://doi.org/10.1016/j.cpc.2015.01.005openalex-snapshot
Stratified sampling for the Ising model: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.003openalex-snapshot
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.002openalex-snapshot
Approximately counting paths and cycles in a graph
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.003openalex-snapshot
Inapproximability of the Tutte polynomial
inferred← citeshttps://doi.org/10.1016/j.ic.2011.10.007openalex-snapshot
Sparse reliable graph backbones
inferred← citeshttps://doi.org/10.1016/j.ic.2018.01.003openalex-snapshot
Complexity classification of the six-vertex model
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105066openalex-snapshot
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105340openalex-snapshot
Two-state spin systems with negative interactions
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105421openalex-snapshot
Dichotomy for Holant* problems with one ternary function on domain size 3
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.04.012openalex-snapshot
Approximating partition functions of the two-state spin system
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.04.005openalex-snapshot
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.007openalex-snapshot
Approximating the partition function of planar two-state spin systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.009openalex-snapshot
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
inferred← citeshttps://doi.org/10.1016/j.neunet.2011.12.001openalex-snapshot
Bayesian spectral deconvolution with the exchange Monte Carlo method
inferred← citeshttps://doi.org/10.1016/j.nuclphysb.2009.01.007openalex-snapshot
A worm algorithm for the fully-packed loop model
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.007openalex-snapshot
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.024openalex-snapshot
Evolutionary algorithms and dynamic programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.017openalex-snapshot
Total variation discrepancy of deterministic random walks for ergodic Markov chains
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.014openalex-snapshot
Sampling weighted perfect matchings on the square-octagon lattice
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.001openalex-snapshot
Functional clones and expressibility of partition functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.009openalex-snapshot
Zero-freeness and approximation of real Boolean Holant problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114491openalex-snapshot
Beyond windability: Approximability of the four-vertex model
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114940openalex-snapshot
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
inferred← citeshttps://doi.org/10.1016/s0378-4371(01)00445-9openalex-snapshot
Counting over non-planar graphs
inferred← citeshttps://doi.org/10.1016/s0378-4754(97)00072-4openalex-snapshot
Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00109-6openalex-snapshot
Parallel ‘go with the winners’ algorithms in distributed memory models
inferred← citeshttps://doi.org/10.1017/9781107477063openalex-snapshot
Complexity Dichotomies for Counting Problems
inferred← citeshttps://doi.org/10.1017/fms.2021.40openalex-snapshot
More on zeros and approximation of the Ising partition function
inferred← citeshttps://doi.org/10.1017/fms.2022.4openalex-snapshot
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
inferred← citeshttps://doi.org/10.1017/s0021900200005477openalex-snapshot
Fixed Precision MCMC Estimation by Median of Products of Averages
inferred← citeshttps://doi.org/10.1017/s0963548300000390openalex-snapshot
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
inferred← citeshttps://doi.org/10.1017/s0963548300000675openalex-snapshot
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1017/s0963548302005515openalex-snapshot
A Path Method for the Logarithmic Sobolev Constant
inferred← citeshttps://doi.org/10.1017/s0963548303005844openalex-snapshot
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
inferred← citeshttps://doi.org/10.1017/s096354830600767xopenalex-snapshot
The Complexity of Ferromagnetic Ising with Local Fields
inferred← citeshttps://doi.org/10.1017/s0963548306007966openalex-snapshot
On the Ashkin–Teller Model and Tutte–Whitney Functions
inferred← citeshttps://doi.org/10.1017/s0963548312000259openalex-snapshot
Complexity of Ising Polynomials
inferred← citeshttps://doi.org/10.1017/s0963548312000296openalex-snapshot
A Graph Polynomial for Independent Sets of Bipartite Graphs
inferred← citeshttps://doi.org/10.1017/s0963548314000339openalex-snapshot
Approximately Counting Embeddings into Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548315000401openalex-snapshot
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
inferred← citeshttps://doi.org/10.1017/s0963548321000080openalex-snapshot
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
inferred← citeshttps://doi.org/10.1023/a:1004610900745openalex-snapshot
The Swendsen–Wang Process Does Not Always Mix Rapidly
inferred← citeshttps://doi.org/10.1023/a:1010091220143openalex-snapshot
The Cross-Entropy Method for Combinatorial and Continuous Optimization
inferred← citeshttps://doi.org/10.1023/a:1011241620180openalex-snapshot
On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects
inferred← citeshttps://doi.org/10.1038/s41598-022-07296-zopenalex-snapshot
Noise-assisted variational quantum thermalization
inferred← citeshttps://doi.org/10.1038/srep34089openalex-snapshot
A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
inferred← citeshttps://doi.org/10.1063/1.533181openalex-snapshot
The Potts model and the Tutte polynomial
inferred← citeshttps://doi.org/10.1063/1.533199openalex-snapshot
Analyzing Glauber dynamics by comparison of Markov chains
inferred← citeshttps://doi.org/10.1063/5.0013689openalex-snapshot
Efficient algorithms for approximating quantum partition functions
inferred← citeshttps://doi.org/10.1063/5.0040256openalex-snapshot
Classical restrictions of generic matrix product states are quasi-locally Gibbsian
inferred← citeshttps://doi.org/10.1063/5.0302877openalex-snapshot
Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code
inferred← citeshttps://doi.org/10.1073/pnas.1505664112openalex-snapshot
A complexity classification of spin systems with an external field
inferred← citeshttps://doi.org/10.1080/07474946.2013.843323openalex-snapshot
Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded Variable Means
inferred← citeshttps://doi.org/10.1080/10618600.1999.10474829openalex-snapshot
Improvements of the Maximum Pseudo-Likelihood Estimators in Various Spatial Statistical Models
inferred← citeshttps://doi.org/10.1080/10629360600680720openalex-snapshot
An upper bound on the convergence time of the Gibbs sampler in Ising models
inferred← citeshttps://doi.org/10.1080/14786435.2017.1312023openalex-snapshot
The Multilevel Splitting algorithm for graph colouring with application to the Potts model
inferred← citeshttps://doi.org/10.1080/15326340701471117openalex-snapshot
Perfect Simulation for Image Restoration
inferred← citeshttps://doi.org/10.1080/15598608.2011.10412038openalex-snapshot
Simulation Reductions for the Ising Model
inferred← citeshttps://doi.org/10.1081/stm-200033117openalex-snapshot
Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
inferred← citeshttps://doi.org/10.1088/0305-4470/38/50/002openalex-snapshot
The number of link and cluster states: the core of the 2Dqstate Potts model
inferred← citeshttps://doi.org/10.1088/1367-2630/aa5fdbopenalex-snapshot
Commuting quantum circuits and complexity of Ising partition functions
inferred← citeshttps://doi.org/10.1088/1367-2630/ab3adcopenalex-snapshot
Generalised versions of separable decompositions applicable to bipartite entangled quantum states
inferred← citeshttps://doi.org/10.1088/1742-5468/aa6f1eopenalex-snapshot
Spectral bounds for the Ising ferromagnet on an arbitrary given graph
inferred← citeshttps://doi.org/10.1088/1742-5468/ab3217openalex-snapshot
Gauging variational inference*
inferred← citeshttps://doi.org/10.1088/1742-5468/ab3218openalex-snapshot
Bucket renormalization for approximate inference*
inferred← citeshttps://doi.org/10.1088/1742-5468/abcaf1openalex-snapshot
Tractable minor-free generalization of planar zero-field Ising models
inferred← citeshttps://doi.org/10.1088/1751-8121/aa565fopenalex-snapshot
Quantum circuits and low-degree polynomials over F 2
inferred← citeshttps://doi.org/10.1088/2058-9565/ae57d6openalex-snapshot
Counting with the quantum alternating operator ansatz
inferred← citeshttps://doi.org/10.1089/cmb.2007.0144openalex-snapshot
Analysis of Basic Clustering Algorithms for Numerical Estimation of Statistical Averages in Biomolecules
inferred← citeshttps://doi.org/10.1090/memo/1092openalex-snapshot
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
inferred← citeshttps://doi.org/10.1090/pspum/110/02007openalex-snapshot
What is a combinatorial interpretation?
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1093/biomet/84.1.1openalex-snapshot
Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
inferred← citeshttps://doi.org/10.1093/biomet/87.4.749openalex-snapshot
Bounding the convergence time of the Gibbs sampler in Bayesian image restoration
inferred← citeshttps://doi.org/10.1093/biomet/91.3.751openalex-snapshot
Efficient recursions for general factorisable models
inferred← citeshttps://doi.org/10.1098/rspa.2015.0301openalex-snapshot
Quantum speedup of Monte Carlo methods
inferred← citeshttps://doi.org/10.1101/2021.02.24.21252390openalex-snapshot
Graphical Models of Pandemic
inferred← citeshttps://doi.org/10.1101/2023.09.16.558052openalex-snapshot
Efficient Enumeration and Visualization of Helix-coil Ensembles
inferred← citeshttps://doi.org/10.1103/physreva.103.032422openalex-snapshot
Computing partition functions in the one-clean-qubit model
inferred← citeshttps://doi.org/10.1103/physreva.61.022301openalex-snapshot
Problem of equilibration and the computation of correlation functions on a quantum computer
inferred← citeshttps://doi.org/10.1103/physreva.76.042306openalex-snapshot
Quantum speedup of classical mixing processes
inferred← citeshttps://doi.org/10.1103/physreva.78.042336openalex-snapshot
Speedup via quantum sampling
inferred← citeshttps://doi.org/10.1103/physreva.80.022340openalex-snapshot
Quantum algorithm for approximating partition functions
inferred← citeshttps://doi.org/10.1103/physreva.90.022304openalex-snapshot
Quantum algorithm for an additive approximation of Ising partition functions
inferred← citeshttps://doi.org/10.1103/physrevapplied.17.044046openalex-snapshot
High-Quality Thermal Gibbs Sampling with Quantum Annealing Hardware
inferred← citeshttps://doi.org/10.1103/physrevb.96.041119openalex-snapshot
Self-learning quantum Monte Carlo method in interacting fermion systems
inferred← citeshttps://doi.org/10.1103/physrevd.102.094504openalex-snapshot
Perturbative removal of a sign problem
inferred← citeshttps://doi.org/10.1103/physreve.109.055301openalex-snapshot
Ising model partition-function computation as a weighted counting problem
inferred← citeshttps://doi.org/10.1103/physrevlett.101.130504openalex-snapshot
Quantum Simulations of Classical Annealing Processes
inferred← citeshttps://doi.org/10.1103/physrevlett.117.080501openalex-snapshot
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
inferred← citeshttps://doi.org/10.1103/physrevlett.119.100503openalex-snapshot
Polynomial-Time Classical Simulation of Quantum Ferromagnets
inferred← citeshttps://doi.org/10.1103/physrevlett.128.220503openalex-snapshot
How to Simulate Quantum Measurement without Computing Marginals
inferred← citeshttps://doi.org/10.1103/physrevlett.99.110601openalex-snapshot
Dynamic Critical Behavior of the Worm Algorithm for the Ising Model
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.013001openalex-snapshot
Complexity phase transitions in instantaneous quantum polynomial-time circuits
inferred← citeshttps://doi.org/10.1103/physrevx.11.011047openalex-snapshot
Improved Thermal Area Law and Quasilinear Time Algorithm for Quantum Gibbs States
inferred← citeshttps://doi.org/10.1103/physrevx.15.021085openalex-snapshot
Phase Diagram of Extensive-Rank Symmetric Matrix Denoising beyond Rotational Invariance
showing the first 200 of 464 · page through all 464
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.