activity
19972024
most citedRelaxation in graph coloring and satisfiability problems

42 citations · 74 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG2024★ 27 cited

Self-Supervised Learning of Time Series Representation via Diffusion Process and Imputation-Interpolation-Forecasting Mask

Zineb Senane, Lele Cao, Valentin Leonhard Buchner +6

Time Series Representation Learning (TSRL) focuses on generating informative representations for various Time Series (TS) modeling tasks. Traditional Self-Supervised Learning (SSL)…

q-bio.PE2005

Quasispecies and recombination

Martin Nilsson Jacobi, Mats Nordahl

Recombination is introduced into Eigen's theory of quasispecies evolution. Comparing numerical simulations of the rate equations in the non-recombining and recombining cases show t…

cond-mat.stat-mech1999★ 1 cited

Vortex Dynamics and Entropic Coulomb Forces in Ising and Potts Antiferromagnets and Ice Models

Cristopher Moore, Mats G. Nordahl, Nelson Minar +1

We study the dynamics of topological defects in the triangular Ising antiferromagnet, a related model on the square lattice equivalent to the six-vertex ice model, and the three-st…

cond-mat.dis-nn1998★ 42 cited

Relaxation in graph coloring and satisfiability problems

Pontus Svenson, Mats G. Nordahl

Using T=0 Monte Carlo simulation, we study the relaxation of graph coloring (K-COL) and satisfiability (K-SAT), two hard problems that have recently been shown to possess a phase t…

cond-mat1998

Complexity of Two-Dimensional Patterns

Kristian Lindgren, Cristopher Moore, Mats G. Nordahl

In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-establi…

comp-gas1997★ 4 cited

Lattice Gas Prediction is P-complete

Cristopher Moore, Mats G. Nordahl

We show that predicting the HPP or FHP III lattice gas for finite time is equivalent to calculating the output of an arbitrary Boolean circuit, and is therefore P-complete: that is…