Search Results - Probability polynomial time algorithm*

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model.

Authors: Chen, Xi De, Anindya Lee, Chin Ho et al.

Source: ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-28, 28p

Subject Terms: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, ALGORITHMS

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems

Authors: Bampis, Evripidis Escoffier, Bruno Fotakis, Dimitris et al.

Index Terms: Computer Science - Data Structures and Algorithms, text

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

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 quasi-polynomial time algorithm for multi-arrival on tree-like multigraphs

Authors: Ghorbani, Ebrahim Hoff, Jonah Leander Mnich, Matthias

Subject Terms: 0: Computer Science, Information and General Works::004: Computer Sciences, Information and General Works::005: Computer Programming, Programs, Data and Security::005.1: Programming, 5: Natural Sciences and Mathematics::519: Applied Mathematics, Probabilities

File Description: application/pdf

Relation: Leibniz international proceedings in informatics (LIPIcs); 42nd International Symposium on Theoretical Aspects of Computer Science, (STACS 2025); International Symposium on Theoretical Aspects of Computer Science, STACS 2025; https://hdl.handle.net/11420/54469; https://doi.org/10.15480/882.14836

Availability: https://hdl.handle.net/11420/54469
https://doi.org/10.15480/882.14836

The Compact Genetic Algorithm Struggles on Cliff Functions.

Authors: Neumann, Frank Sudholt, Dirk Witt, Carsten

Source: Algorithmica; Apr2025, Vol. 87 Issue 4, p507-536, 30p

Subject Terms: EVOLUTIONARY algorithms, DISTRIBUTION (Probability theory), POLYNOMIAL time algorithms, GENETIC algorithms, PHASE transitions

Optimization problems with uncertain objective coefficients using capacities.

Authors: Vu, Tuan-Anh Afifi, Sohaib Lefèvre, Eric et al.

Source: Annals of Operations Research. Jan2025, Vol. 344 Issue 1, p383-412. 30p.

Subject Terms: *DECISION making, MULTI-objective optimization, POLYNOMIAL time algorithms, GREEDY algorithms, COMBINATORIAL optimization

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs.

Authors: Zhang, Yexin Zhou, Shuo Wang, Xinzhao et al.

Source: Nature Communications; 10/22/2025, Vol. 16 Issue 1, p1-11, 11p

Subject Terms: MARKOV chain Monte Carlo, SAMPLING methods, MARKOV processes, QUANTUM graph theory, UNDIRECTED graphs, POLYNOMIAL time algorithms

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses

Authors: Sarriguren, Alfredo Goñi

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, F.2.2, text

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

On completely factoring any integer efficiently in a single run of an order-finding algorithm

Authors: Ekerå, Martin

Source: Quantum Information Processing. 20(6)

Subject Terms: Factoring, Order finding, Shor’s algorithms, Magnetic materials, Quantum optics, Computational costs, Finding algorithm, High probability, Integer-N, Polynomial-time, Post processing, Prime factors, Single element, Polynomial approximation

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309987
https://doi.org/10.1007/s11128-021-03069-1

Dicke State Quantum Search for Solving the Vertex Cover Problem.

Authors: Jiang, Jehn-Ruey

Source: Mathematics (2227-7390); Sep2025, Vol. 13 Issue 18, p3005, 28p

Subject Terms: NP-complete problems, POLYNOMIAL time algorithms, COMBINATORIAL optimization, QUANTUM computing, QUANTUM superposition

A framework of distributionally robust possibilistic optimization.

Authors: Guillaume, Romain Kasperski, Adam Zieliński, Paweł

Source: Fuzzy Optimization & Decision Making. Jun2024, Vol. 23 Issue 2, p253-278. 26p.

Subject Terms: *DISTRIBUTION (Probability theory), *VALUE at risk, *PROBLEM solving, POLYNOMIAL time algorithms, ROBUST optimization

Quantum walk search algorithm on hypercube : eigenanalysis and calculation of the probability of success in polynomial time ; Algorithme de recherche par marche quantique sur hypercube : analyse propre et calcul de la probabilité de succès en temps polynomial

Authors: Pillin, Hugo Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC) École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom Paris (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique) et al.

Contributors: Pillin, Hugo Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC) École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom Paris (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique) et al.

Source: https://theses.hal.science/tel-04874798 ; Emerging Technologies [cs.ET]. Université de Bretagne occidentale - Brest, 2024. English. ⟨NNT : 2024BRES0024⟩.

Subject Terms: Computation in polynomial time, Probability of success, Quantum walk, Grover’s algorithm, Quantum algorithm, Calcul en temps polynomial, Probabilité de succès, Marche quantique, Algorithme de Grover, Algorithme quantique, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]

Relation: NNT: 2024BRES0024

Availability: https://theses.hal.science/tel-04874798
https://theses.hal.science/tel-04874798v1/document
https://theses.hal.science/tel-04874798v1/file/These-2024-MATHSTICBO-Telecommunications-PILLIN_Hugo.pdf

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

Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time.

Authors: BAUWENS, BRUNO ZIMAND, MARIUS

Source: Journal of the ACM; Apr2023, Vol. 70 Issue 2, p1-33, 33p

Subject Terms: POLYNOMIAL time algorithms, KOLMOGOROV complexity, COMPRESSORS, IMAGE compression

Linear Algorithms for Robust and Scalable Nonparametric Multiclass Probability Estimation.

Authors: LIYUN ZENG HAO HELEN ZHANG

Source: Journal of Data Science; Oct2023, Vol. 21 Issue 4, p658-680, 23p

Subject Terms: NONPARAMETRIC estimation, CONDITIONAL probability, SUPPORT vector machines, POLYNOMIAL time algorithms, STATISTICS, PROBABILITY theory, COMPUTATIONAL complexity, POLYNOMIAL chaos

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

Probability bounds for n random events under (n − 1)-wise independence.

Authors: Natarajan, Karthik Ramachandra, Arjun Tan, Colin

Source: Operations Research Letters. Jan2023, Vol. 51 Issue 1, p116-122. 7p.

Subject Terms: *PROBABILITY theory, POLYNOMIAL time algorithms, PROBABILITY measures

FULLY POLYNOMIAL-TIME RANDOMIZED APPROXIMATION SCHEMES FOR GLOBAL OPTIMIZATION OF HIGH-DIMENSIONAL MINIMAX CONCAVE PENALIZED GENERALIZED LINEAR MODELS.

Authors: HERNANDEZ, CHARLES HUNG-YI LEE JINDONG TONG et al.

Source: Journal of Nonlinear & Variational Analysis; 2024, Vol. 8 Issue 6, p909-934, 26p

Subject Terms: GLOBAL optimization, NP-hard problems, MATHEMATICAL optimization, ALGORITHMS, PROBABILITY theory

An asymptotically optimal algorithm for online stacking.

Authors: Olsen, Martin Andersen, Lars Nørvang Gross, Allan

Source: Mathematical Methods of Operations Research. Apr2023, Vol. 97 Issue 2, p161-178. 18p.

Subject Terms: *TIME management, ONLINE algorithms, POLYNOMIAL time algorithms, PROBABILITY density function