A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2004
- Urheber
- Handle
-
2003/5452
- URN
-
urn:nbn:de:101:1-201607133964
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fischer, Simon
- Universitätsbibliothek Dortmund
Entstanden
- 2004
Ähnliche Objekte (12)
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
The two-dimensional Ising spin glass at zero temperature
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Critical region for droplet formation in the two-dimensional Ising model
A simple tensor network algorithm for two-dimensional steady states
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
The two-dimensional Ising spin glass at zero temperature
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Critical region for droplet formation in the two-dimensional Ising model
A simple tensor network algorithm for two-dimensional steady states
A polynomial-time parsing algorithm for TT-MCTAG
Towards a Genuinely Polynomial Algorithm for Linear Programming
The two-dimensional Ising spin glass at zero temperature
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A Relaxation Algorithm for a Class of Decomposable Polynomial Programming Problems
A polynomial algorithm for a NP-hard to solve optimization problem
A polynomial linear search algorithm for the N-dimensional Knapsack problem
Critical region for droplet formation in the two-dimensional Ising model