- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Optimal sufficient requirements on the embedded Ising problem in polynomial time ; volume:22 ; number:8 ; day:8 ; month:8 ; year:2023 ; pages:1-44 ; date:8.2023
Quantum information processing ; 22, Heft 8 (8.8.2023), 1-44, 8.2023
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11128-023-04058-2
- URN
-
urn:nbn:de:101:1-2023112011514765852557
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:21 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lobe, Elisabeth
- Kaibel, Volker
- SpringerLink (Online service)
Other Objects (12)
Polynomial multiplication on embedded vector architectures
On the observability of embedded polynomial dynamical systems
Mixing Time of Critical Ising Model on Trees is Polynomial in the Height
Some Strong Sufficient Conditions for Cyclic Homogeneous Polynomial Inequalities of Degree Four in Real Variables
Sufficient
From Sufficient Health to Sufficient Responsibility
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
Change-oriented requirements traceability : support for evolution of embedded systems
Ising
Sufficient Statistics
Günter Ising (Mzensk) an Marie Ising (Dortmund)
Günter Ising (Lopasnja) an Marie Ising (Dortmund)
Polynomial multiplication on embedded vector architectures
On the observability of embedded polynomial dynamical systems
Mixing Time of Critical Ising Model on Trees is Polynomial in the Height
Some Strong Sufficient Conditions for Cyclic Homogeneous Polynomial Inequalities of Degree Four in Real Variables
Sufficient
From Sufficient Health to Sufficient Responsibility
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
Change-oriented requirements traceability : support for evolution of embedded systems
Ising
Sufficient Statistics
Günter Ising (Mzensk) an Marie Ising (Dortmund)
Günter Ising (Lopasnja) an Marie Ising (Dortmund)
Polynomial multiplication on embedded vector architectures
On the observability of embedded polynomial dynamical systems
Mixing Time of Critical Ising Model on Trees is Polynomial in the Height
Some Strong Sufficient Conditions for Cyclic Homogeneous Polynomial Inequalities of Degree Four in Real Variables
Sufficient
From Sufficient Health to Sufficient Responsibility
A polynomial upper bound for a mutation based algorithm on the two-dimensional Ising model
Change-oriented requirements traceability : support for evolution of embedded systems
Ising
Sufficient Statistics
Günter Ising (Mzensk) an Marie Ising (Dortmund)