Výsledky vyhľadávania - "Polynomial algorithm"

On A. V. Anisimov’s problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages

Autori: Yordzhev, Krasimir

Zdroj: Filomat, 2024 Jan 01. 38(12), 4157-4166.

Prístupová URL adresa: https://www.jstor.org/stable/27387386

Algorithm for the CSR Expansion of Max-Plus Matrices Using the Characteristic Polynomial: Algorithm for the CSR expansion of max-plus matrices using the characteristic polynomial

Autori: Nishida, Yuki

Zdroj: SIAM Journal on Discrete Mathematics. 39:575-592

Predmety: algebraic eigenvalue, tropical semiring, 15A80, 93C65, Nachtigall expansion, Optimization and Control (math.OC), FOS: Mathematics, max-plus algebra, CSR expansion, Max-plus and related algebras, Discrete event control/observation systems, Mathematics - Optimization and Control, shortest path problem

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2311.03844

Many-body Liouvillian dynamics with a non-Hermitian tensor-network kernel polynomial algorithm

Autori: Chen, Guangze Lado, Jose L. Song, Fei

Zdroj: Simulating non-Hermitian many-body topological phases with giant atoms (SING-ATOM) Physical Review Research. 6(4)

Popis súboru: electronic

Prístupová URL adresa: https://research.chalmers.se/publication/545072
https://research.chalmers.se/publication/545072/file/545072_Fulltext.pdf

A polynomial algorithm for best-subset selection problem

Autori: Zhu, Junxian Wen, Canhong Zhu, Jin a ďalší

Zdroj: Proceedings of the National Academy of Sciences of the United States of America, 2020 Dec . 117(52), 33117-33123.

Prístupová URL adresa: https://www.jstor.org/stable/27006536

A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column

Autori: Daniel Dadush Zhuan Khye Koh Bento Natura a ďalší

Prispievatelia: Daniel Dadush Zhuan Khye Koh Bento Natura a ďalší

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing

Predmety: interior point methods, strongly polynomial, circuits, interior point method, linear programming, strongly polynomial algorithms, generalized flow

Prístupová URL adresa: http://eprints.lse.ac.uk/129539/
http://eprints.lse.ac.uk/122569/

An Efficient Boubakar-Chebyshev Polynomial Algorithm for High-Order Non-Linear Volterra-Fredholm Integro-Differential Equations

Autori: Ishaq Ajimoti, Adam Ayinde Muhmmed, Abdullahi

Predmety: Fredholm integro-differential equations, Collocation points, Chebyshev Gauss-Radau, Approximate solution, Third Kind Chebyshev polynomial

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk)

Autori: Dadush, Daniel Koh, Zhuan Khye Natura, Bento a ďalší

Prispievatelia: Dadush, Daniel Koh, Zhuan Khye Natura, Bento a ďalší

Predmety: Interior Point Methods, ddc:004, Linear Programming, Strongly Polynomial Algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.2

A (Weakly) Polynomial Algorithm for AIVF Coding

Autori: Dolatabadi, Reza Hosseini Golin, Mordecai J. Zamani, Arian

Zdroj: 2024 IEEE International Symposium on Information Theory (ISIT). :67-72

Predmety: FOS: Computer and information sciences, F.2, Computer Science - Data Structures and Algorithms, E.4, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2405.06805

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control

Autori: Vitali, Jerome

Predmety: Hadamard Inequality, Polynomial Pivot Bound, PN Algorithm, Lexicographic Perturbation, Universal Shock Lemma, Epoch Law, Linear Programming, Combinatorial Pivoting, Strongly-Polynomial Algorithm, Bit-Agnostic Optimization, Deterministic Optimization

The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

Autori: A. V. Smirnov

Zdroj: Моделирование и анализ информационных систем, Vol 29, Iss 4, Pp 372-387 (2022)

Predmety: shortest path, multiple graph, 0211 other engineering and technologies, reachability set, polynomial algorithm, Information technology, 0102 computer and information sciences, 02 engineering and technology, T58.5-58.64, 01 natural sciences, multiple path, divisible graph

Prístupová URL adresa: https://doaj.org/article/2a9cfcfb43004102810866d489943e9f

A polynomial algorithm to compute the boxicity and threshold dimension of complements of block graphs

Autori: Caoduro, Marco Evans, Will Gaede, Tao

Predmety: 05C62 (primary) 05C10, 05C85 (secondary), Combinatorics, FOS: Mathematics, Combinatorics (math.CO)

Prístupová URL adresa: http://arxiv.org/abs/2510.02199

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk)

Autori: Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh Dadush, Daniel Koh, Zhuan Khye a ďalší

Témy: Linear Programming, Strongly Polynomial Algorithms, Interior Point Methods, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.2
Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset

Autori: Lozovanu, Dmitrii

Predmety: Optimization and Control (math.OC), 65K05, 68Q17, FOS: Mathematics, Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/abs/2502.08286

On A.V. Anisimov’s problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages

Autori: Krasimir Yordzhev

Zdroj: Filomat. 38:4157-4166

Graph-Based Deterministic Polynomial Algorithm for NP Problems

Autori: Lee, Changryeol

Predmety: FOS: Computer and information sciences, Computational Complexity, F.1.3, F.2.0, F.4.1, Computational Complexity (cs.CC), P=NP, NP-Complete, Time Complexity, Deterministic Simulation, Turing Machine Computation Model, Feasible Graph

Prístupová URL adresa: http://arxiv.org/abs/2508.13166

A polynomial algorithm for some instances of NP-complete problems

Autori: Marius Costandin Bogdan Gavrea

Zdroj: Studia Universitatis Babes-Bolyai Matematica. 69:233-244

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

A Strongly Polynomial Algorithm for Generalized Flow Maximization

Autori: Végh, László A.

Zdroj: Mathematics of Operations Research, 2017 Feb 01. 42(1), 179-211.

Prístupová URL adresa: https://www.jstor.org/stable/26179257

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning

Autori: Diakonikolas, Ilias Tzamos, Christos Kane, Daniel M

Predmety: Applied Mathematics, Information and Computing Sciences, Pure Mathematics, Mathematical Sciences, PAC learning, Halfspaces, Massart Noise

Prístupová URL adresa: https://escholarship.org/uc/item/4h41d0vv

A strongly polynomial algorithm for linear exchange markets

Autori: Jugal Garg László A. Végh Charikar, Moses a ďalší

Prispievatelia: Jugal Garg László A. Végh Charikar, Moses a ďalší

Zdroj: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing -STOC 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

Predmety: 0211 other engineering and technologies, two-variable-per-inequality systems, 0102 computer and information sciences, 02 engineering and technology, Z+-Matrix, Strongly Polynomial Algorithm, 01 natural sciences, Linear Exchange Markets, Market Equilibria, strongly polynomial algorithm, Computer Science - Data Structures and Algorithms, optimization, linear exchange markets, market equilibria

Prístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3313276.3316340
http://arxiv.org/abs/1809.06266
https://dblp.uni-trier.de/db/journals/corr/corr1809.html#abs-1809-06266
https://arxiv.org/abs/1809.06266
https://dl.acm.org/doi/10.1145/3313276.3316340
https://arxiv.org/pdf/1809.06266.pdf
https://eprints.lse.ac.uk/101048/
https://experts.illinois.edu/en/publications/a-strongly-polynomial-algorithm-for-linear-exchange-markets
http://eprints.lse.ac.uk/101048/
http://eprints.lse.ac.uk/113604/

A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection

Autori: Güden, Hüseyin Süral, Haldun

Zdroj: The Journal of the Operational Research Society, 2017 Jan 01. 68(9), 1085-1093.

Prístupová URL adresa: https://www.jstor.org/stable/48760012