Výsledky vyhledávání - "polynomial-time algorithm"

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems

Autoři: David Könen Michael Stiglmayr

Zdroj: Discrete Applied Mathematics. 376:1-14

Témata: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Přístupová URL adresa: http://arxiv.org/abs/2305.12867

A Polynomial Time Algorithm for Solving Sudoku Problems

Autoři: Youqiang Yu

A quasi-polynomial time algorithm for multi-arrival on tree-like multigraphs

Autoři: Ghorbani, Ebrahim Hoff, Jonah Leander Mnich, Matthias a další

Přispěvatelé: Ghorbani, Ebrahim Hoff, Jonah Leander Mnich, Matthias a další

Témata: Fixed-Parameter Tractability, Computer Science, Information and General Works::004: Computer Sciences, Rotor-routing, Arrival, Path-Like Multigraph, Tree-like Multigraph, ddc:004, Natural Sciences and Mathematics::519: Applied Mathematics, Probabilities, Computer Science, Information and General Works::005: Computer Programming, Programs, Data and Security::005.1: Programming

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.39

A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums

Autoři: Guoce Xin Xinyu Xu

Zdroj: Experimental Mathematics. 34:342-349

Témata: Mathematics - Number Theory, FOS: Mathematics, Primary 11F20, Secondary 11Y16, 05A15, 11L03, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), Number Theory (math.NT), 0101 mathematics, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2303.01185

A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli

Autoři: Shi Bai Hansraj Jangir Elena Kirshanova a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783032018779

A polynomial time algorithm for Sylvester waves when entries are bounded

Autoři: Guoce Xin Chen Zhang

Zdroj: Advances in Applied Mathematics. 170:102931

Témata: FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Primary 05--08, Secondary 05--04, 05A17

Přístupová URL adresa: http://arxiv.org/abs/2406.18975

A Polynomial-Time Algorithm for EFX Orientations of Chores

Autoři: Hsu, Kevin King, Valerie

Témata: Computer Science - Computer Science and Game Theory, Computer Science - Artificial Intelligence, Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/2501.13481

A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree

Autoři: Enrico Angelelli Renata Mansini Romeo Rizzi

Zdroj: Mathematics of Operations Research.

Témata: traveling salesman problem with profits, probabilistic profitable tour problem, polynomial-time complexity, special graph structure, tree

Popis souboru: application/pdf

Přístupová URL adresa: https://pubsonline.informs.org/doi/abs/10.1287/moor.2022.0306
https://doi.org/10.1287/moor.2022.0306
https://hdl.handle.net/11379/632227

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition

Autoři: Anagnostides, Ioannis Farina, Gabriele Sandholm, Tuomas a další

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Computer Science and Game Theory, Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control, Computer Science and Game Theory (cs.GT), Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2504.03432

A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem

Autoři: Awoniyi, Samuel

Témata: Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC

Přístupová URL adresa: http://arxiv.org/abs/2505.01426

A strongly polynomial-time algorithm for the general linear programming problem

Autoři: Awoniyi, Samuel

Témata: Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC

Přístupová URL adresa: http://arxiv.org/abs/2503.12041

A polynomial-time algorithm for the automatic Baire property

Autoři: Staiger, Ludwig

Témata: FOS: Computer and information sciences, 68Q45, Formal Languages and Automata Theory (cs.FL), F.4, Computer Science - Formal Languages and Automata Theory

Přístupová URL adresa: http://arxiv.org/abs/2501.15192

A Polynomial Time Algorithm for the Fractional F-Density

Autoři: Guantao Chen Guoning Yu

A polynomial time algorithm for the triangle packing problem on interval graphs

Autoři: Young-Soo Myung

Zdroj: Discrete Applied Mathematics. 343:180-183

Nondeterministic polynomial time algorithm for estimation of space launch base launch capacity

Autoři: Michal Kurela Olivier Nogues Jean-Frédéric Alasa

Zdroj: Acta Astronautica. 234:783-794

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor

Autoři: Groenland, Carla Nederlof, Jesper Koana, Tomohiro

Témata: rooted minor, Steiner tree

Přístupová URL adresa: https://research-portal.uu.nl/en/publications/3afb9c5b-eb34-46a1-a489-2deac8de794a

A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique

Autoři: Muhammad Tlas

Zdroj: Network Biology, Vol 13, Iss 4, Pp 122-136 (2023)

Témata: maximum flow problem, bit-capacity scaling algorithm, polynomial time algorithm, augmenting path method, network flow, Biology (General), QH301-705.5

Popis souboru: electronic resource

Relation: http://www.iaees.org/publications/journals/nb/articles/2023-13(4)/maximal-constrained-network-flow-problem.pdf; https://doaj.org/toc/2220-8879

Přístupová URL adresa: https://doaj.org/article/0ed7ae09a9704990aa6ba28815ce206f

A Polynomial-Time Algorithm for the Secure State Estimation Problem Under Sparse Sensor Attacks via State Decomposition Technique

Autoři: An-Yang Lu Guang-Hong Yang

Zdroj: IEEE Transactions on Automatic Control. 68:7451-7465

A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem

Autoři: Balázs Vass Erika R. Bérczi-Kovács Ábel Barabás a další

Zdroj: IEEE/ACM Transactions on Networking. 31:3051-3062

Témata: QA Mathematics / matematika, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Popis souboru: text

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes

Autoři: Mordecai Golin Elfarouk Harb

Zdroj: IEEE Transactions on Information Theory. 69:6269-6278

Témata: AIFV-m codes, Ellipsoid methods, Linear programming, AIFV codes, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences