A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
- Ereignis
-
Veröffentlichung
- (wo)
-
Hamburg
- (wer)
-
Technische Universität Hamburg. Universitätsbibliothek
- (wann)
-
2025
- Urheber
- DOI
-
10.15480/882.14836
- URN
-
urn:nbn:de:101:1-2503050238105.913675628656
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:22 MESZ
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
- Ghorbani, Ebrahim
- Hoff, Jonah Leander
- Mnich, Matthias
- Technische Universität Hamburg. Universitätsbibliothek
Entstanden
- 2025
Ähnliche Objekte (12)
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Quasi-topological Ricci polynomial gravities
Online Algorithm for Arrival & Service Curve Estimation
Quasi-analytical root-finding for non-polynomial functions
Towards a Genuinely Polynomial Algorithm for Linear Programming
A polynomial-time parsing algorithm for TT-MCTAG
ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees
OCTAL: Optimal Completion of gene trees in polynomial time
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
Arrival
The Turán and Laguerre inequalities for quasi-polynomial-like functions
Two global quasi-Newton algorithms for solving matrix polynomial equations
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Quasi-topological Ricci polynomial gravities
Online Algorithm for Arrival & Service Curve Estimation
Quasi-analytical root-finding for non-polynomial functions
Towards a Genuinely Polynomial Algorithm for Linear Programming
A polynomial-time parsing algorithm for TT-MCTAG
ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees
OCTAL: Optimal Completion of gene trees in polynomial time
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
Arrival
The Turán and Laguerre inequalities for quasi-polynomial-like functions
Two global quasi-Newton algorithms for solving matrix polynomial equations
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Quasi-topological Ricci polynomial gravities
Online Algorithm for Arrival & Service Curve Estimation
Quasi-analytical root-finding for non-polynomial functions
Towards a Genuinely Polynomial Algorithm for Linear Programming
A polynomial-time parsing algorithm for TT-MCTAG
ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees
OCTAL: Optimal Completion of gene trees in polynomial time
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
Arrival
The Turán and Laguerre inequalities for quasi-polynomial-like functions