Search Results - Probability polynomial time algorithm

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

Authors: Kurela, Michal Nogues, Olivier Alasa, Jean-Frédéric

Source: Acta Astronautica. Sep2025, Vol. 234, p783-794. 12p.

Subject Terms: *MONTE Carlo method, *POLYNOMIAL time algorithms, *DISTRIBUTION (Probability theory), *ALGORITHMS, *SCHEDULING

A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation

Authors: Ding, Jian Li, Zhangsong

Source: Foundations of Computational Mathematics. 25:1287-1344

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Probability (math.PR), Machine Learning (stat.ML), 02 engineering and technology, Statistics Theory (math.ST), 01 natural sciences, Machine Learning, Statistics Theory, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, Probability

Access URL: http://arxiv.org/abs/2212.13677

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

Authors: Ghorbani, Ebrahim Hoff, Jonah Leander Mnich, Matthias et al.

Contributors: Ghorbani, Ebrahim Hoff, Jonah Leander Mnich, Matthias et al.

Subject Terms: 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

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.39

Flow-augmentation I: Directed graphs.

Authors: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Source: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-38. 38p.

Subject Terms: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Authors: Ding, Jian Li, Zhangsong

Subject Terms: FOS: Computer and information sciences, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, Probability (math.PR), FOS: Mathematics, Mathematics - Statistics Theory, Data Structures and Algorithms (cs.DS), Machine Learning (stat.ML), Statistics Theory (math.ST), 68Q87, 90C35, Mathematics - Probability

Access URL: http://arxiv.org/abs/2306.00266

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes

Authors: Etessami, Kousha Sinclair, A Yannakakis, Mihalis

Source: Etessami, K, Sinclair, A & Yannakakis, M 2017, ' A polynomial time algorithm for computing extinction probabilities of multi-type branching processes ', SIAM Journal on Scientific Computing, vol. 46, no. 5, pp. 1515-1553 . https://doi.org/10.1137/16M105678X

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

File Description: application/pdf

Access URL: https://www.research.ed.ac.uk/portal/files/29051677/revised_sicomp_sub_after_rev_august16_v3_1.pdf
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp46.html#EtessamiSY17
http://www.research.ed.ac.uk/portal/files/29051677/revised_sicomp_sub_after_rev_august16_v3_1.pdf
https://epubs.siam.org/doi/abs/10.1137/16M105678X
https://www.pure.ed.ac.uk/ws/files/29051677/revised_sicomp_sub_after_rev_august16_v3_1.pdf
https://hdl.handle.net/20.500.11820/3f21cb0e-01cf-45a7-a0e0-60542e95a449

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

Authors: Enrico Angelelli Renata Mansini Romeo Rizzi

Source: Mathematics of Operations Research.

Subject Terms: traveling salesman problem with profits, probabilistic profitable tour problem, polynomial-time complexity, special graph structure, tree

File Description: application/pdf

Access URL: 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

Sampling Balanced Forests of Grids in Polynomial Time

Authors: Sarah Cannon Wesley Pegden Jamie Tucker-Foltz

Source: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1676-1687

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 05 social sciences, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), 0101 mathematics, 01 natural sciences, Computer Science - Discrete Mathematics, 0506 political science

Access URL: http://arxiv.org/abs/2310.15152

Benders decomposition for the large-scale probabilistic set covering problem.

Authors: Liang, Jie Yu, Cheng-Yang Lv, Wei et al.

Source: Computers & Operations Research. May2025, Vol. 177, pN.PAG-N.PAG. 1p.

Subject Terms: *DISTRIBUTION (Probability theory), *INTEGER programming, POLYNOMIAL time algorithms, RANDOM numbers, RANDOM matrices

Constraining the Algorithmic Landscape: A Constructive Approach to Witness Incompressibility and Uniform Verification Limits

Authors: Murphy, Andrew J

Subject Terms: Logic, Science, Entropy, Information Theory, Polynomial Time, Kolmogorov, Mathematical analysis, Witness Generation, PNP, Polynomial, NP, Data science, Mathematical model, Decision Theory, Data Science/methods, Information, Mathematical Proofs, FOS: Mathematics, Mathematical Computing, Probability, P vs NP, Mathematical method, Computational science, Data Science, Pure mathematics, Mathematical Concepts, Models, Theoretical, Applied mathematics, Probability Theory, NP-completeness, Mathematics/methods, Mathematical logic, Kolmogorov Complexity, Cryptography, Data Science/classification, Mathematics/classification, Information Technology, Mathematics, Algorithms, Formal Proofs

A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation.

Authors: Ding, Jian Li, Zhangsong

Source: Foundations of Computational Mathematics; Aug2025, Vol. 25 Issue 4, p1287-1344, 58p

Subject Terms: POLYNOMIAL time algorithms, MATCHING theory, ITERATIVE methods (Mathematics), RANDOM matrices, GRAPH theory, STATISTICAL correlation, RANDOM graphs

A reliable framework for supply chain management using cluster based blockchain for intelligent industrial automation

Authors: Eesa Alsolami Mahmoud Ahmad Al-khasawenh Ala Abdulsalam Alarood et al.

Source: Scientific Reports, Vol 15, Iss 1, Pp 1-18 (2025)

Subject Terms: Intelligent manufacturing system, Industrial automation, Reliable supply chain management, Adversary model, Probability polynomial time algorithm, Medicine, Science

File Description: electronic resource

Relation: https://doaj.org/toc/2045-2322

Access URL: https://doaj.org/article/fece010439d24ab483839d210595dc98

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

Authors: Mordecai Golin Elfarouk Harb

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

Subject Terms: 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

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games

Authors: Argyrios Deligkas Michail Fasoulakis Evangelos Markakis

Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554

Subject Terms: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, 0102 computer and information sciences, 01 natural sciences, Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2207.07007

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing.

Authors: Matsumoto, Namiko Mazumdar, Arya

Source: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-64, 64p

Subject Terms: COMPRESSED sensing, POLYNOMIAL time algorithms, SUBGRADIENT methods, LENGTH measurement, APPROXIMATION error, ORTHOGONAL matching pursuit, THRESHOLDING algorithms

Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements

Authors: Mizuta, Rei

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Probability (math.PR), Mathematics - Operator Algebras, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, Operator Algebras (math.OA), 01 natural sciences, Mathematics - Probability

Access URL: http://arxiv.org/abs/1901.08210

Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits

Authors: Coble, Nolan J. Coudron, Matthew

Source: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). :598-609

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, 0103 physical sciences, FOS: Physical sciences, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Access URL: http://arxiv.org/pdf/2012.05460
http://arxiv.org/abs/2012.05460

A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree

Authors: Tanja Stadler James H. Degnan

Source: Algorithms Mol Biol
Algorithms for Molecular Biology

Subject Terms: 0301 basic medicine, Applied Mathematics, Research, Anomalous gene trees, 0206 medical engineering, Populations and Evolution (q-bio.PE), 02 engineering and technology, Coalescent history, Dynamic programming, Incomplete lineage sorting, 03 medical and health sciences, Computational Theory and Mathematics, Structural Biology, FOS: Biological sciences, Quantitative Biology - Populations and Evolution, Molecular Biology

Access URL: https://almob.biomedcentral.com/track/pdf/10.1186/1748-7188-7-7
https://pubmed.ncbi.nlm.nih.gov/22546066
http://arxiv.org/abs/1203.0204

The Kikuchi Hierarchy and Tensor PCA.

Authors: Wein, Alexander El Alaoui, Ahmed Moore, Cristopher

Source: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-40, 40p

Subject Terms: STATISTICAL physics, SUM of squares, ALGORITHMS, BAYESIAN analysis, MESSAGE passing (Computer science), PRINCIPAL components analysis

A STUDY ON MAXIMUM CARDINALITY r-L(2, 1)-LABELLING PROBLEM ON CIRCULAR-ARC GRAPH AND ITS APPLICATION.

Authors: PATRA, N. AMANATHULLA, S. MONDAL, S. et al.

Source: TWMS Journal of Applied & Engineering Mathematics; 2025, Vol. 15 Issue 6, p1418-1438, 17p

Subject Terms: GRAPH labelings, GRAPH theory, MATHEMATICAL functions, POLYNOMIAL time algorithms