Amanote Research

Amanote Research

    RegisterSign In

A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24854-5_108
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Simon Fischer
Publisher

Springer Berlin Heidelberg


Related search

On the Diagonal Susceptibility of the Two-Dimensional Ising Model

Journal of Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2013English

Two-Dimensional Super-Roughening in the Three-Dimensional Ising Model

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2019English

Two-Dimensional Ising Model With Competing Interactions as a Model for Interacting Π-Rings

Acta Physica Polonica A
AstronomyPhysics
2009English

Polynomial Upper Bound on Interior Steklov Nodal Sets

Journal of Spectral Theory
GeometryNonlinear PhysicsMathematical PhysicsStatisticalTopology
2019English

A Polynomial Based Hashing Algorithm

2008English

Anisotropic Scaling of the Two-Dimensional Ising Model I: The Torus

SciPost Physics
2019English

On the Upper Bound of the Number of Real Zeros of a Random Algebraic Polynomial

Journal of Classical Analysis
2012English

An Analytical Model for the Upper Bound on Temperature Differences on a Chip

2008English

Numerical Evaluations of the Critical Properties of the Two-Dimensional Ising Model

Physical Review B
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy