- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A simple proof for Imnang’s algorithms ; volume:2022 ; number:1 ; day:28 ; month:12 ; year:2022 ; pages:1-5 ; date:12.2022
Journal of inequalities and applications ; 2022, Heft 1 (28.12.2022), 1-5, 12.2022
- Classification
-
Mathematik
- Creator
-
Soori, Ebrahim
O’Regan, Donal
Agarwal, Ravi P.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13660-022-02904-y
- URN
-
urn:nbn:de:101:1-2023030921232448875420
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 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
- Soori, Ebrahim
- O’Regan, Donal
- Agarwal, Ravi P.
- SpringerLink (Online service)
Other Objects (12)
Proof theory and algorithms for answer set programming
Lectures on proof verification and approximation algorithms
On a simple proof of Lambert's theorem.
A SIMPLE PROOF OF KASPAROV'S TECHNICAL THEOREM
New and simple algorithms for stable flow problems
Simple approximative algorithms for free-support Wasserstein barycenters
Heuristic algorithms for understanding chemistry via simple quantities
Simple proof of confidentiality for private quantum channels in noisy environments
A simple axiomatization and constructive representation proof for Choquet Expexted Utility
Plane and simple : using planar subgraphs for efficient algorithms
Computer verification of algorithms using a formal proof system
A Simple Proof and Refinement of Wielandt's Eigenvalue Inequality
Proof theory and algorithms for answer set programming
Lectures on proof verification and approximation algorithms
On a simple proof of Lambert's theorem.
A SIMPLE PROOF OF KASPAROV'S TECHNICAL THEOREM
New and simple algorithms for stable flow problems
Simple approximative algorithms for free-support Wasserstein barycenters
Heuristic algorithms for understanding chemistry via simple quantities
Simple proof of confidentiality for private quantum channels in noisy environments
A simple axiomatization and constructive representation proof for Choquet Expexted Utility
Plane and simple : using planar subgraphs for efficient algorithms
Computer verification of algorithms using a formal proof system
A Simple Proof and Refinement of Wielandt's Eigenvalue Inequality
Proof theory and algorithms for answer set programming
Lectures on proof verification and approximation algorithms
On a simple proof of Lambert's theorem.
A SIMPLE PROOF OF KASPAROV'S TECHNICAL THEOREM
New and simple algorithms for stable flow problems
Simple approximative algorithms for free-support Wasserstein barycenters
Heuristic algorithms for understanding chemistry via simple quantities
Simple proof of confidentiality for private quantum channels in noisy environments
A simple axiomatization and constructive representation proof for Choquet Expexted Utility
Plane and simple : using planar subgraphs for efficient algorithms
Computer verification of algorithms using a formal proof system