Search Results - Probability polynomial time algorithm

A reliable framework for supply chain management using cluster based blockchain for intelligent industrial automation by Alsolami, Eesa, Al-khasawenh, Mahmoud Ahmad, Alarood, Ala Abdulsalam, Alzahrani, Ahmed Omar, Ibraheem, Ahmed Aalameen, Zamani, Mazdak

“… In the modern era of industrial automation, technology entirely depends on intelligent computing algorithms…”
Get full text

A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density by Pardo, Luis M., Sebastián, Daniel

“…The notion of correct test sequence was introduced in [27]. It has been widely used to design probabilistic algorithms for Polynomial Identity Testing (PIT…”
Get full text

A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree by Stadler, Tanja, Degnan, James H

“… Results In this paper, we provide a polynomial time algorithm to calculate the probability of a ranked gene tree topology for a given species tree, where a ranked tree topology is a tree topology…”
Get full text

Finding Hidden Cliques in Linear Time with High Probability by DEKEL, YAEL, GUREL-GUREVICH, ORI, PERES, YUVAL

“…$. This random graph model is denoted $G(n,\frac12,k)$. The hidden clique problem is to design an algorithm that finds the k-clique in polynomial time with high probability…”
Get full text

Polynomial-Time Algorithms for the Exact MMOSPA Estimate of a Multi-Object Probability Density Represented by Particles by Baum, Marcus, Willett, Peter, Hanebeck, Uwe D.

“… But in this work we present the first exact polynomial-time algorithms for calculating the MMOSPA estimate for probability densities that are represented by particles…”
Get full text

Finding tight Hamilton cycles in random hypergraphs faster by Allen, Peter, Koch, Christoph, Parczyk, Olaf, Person, Yury

“… We provide a first deterministic polynomial-time algorithm, which finds a.a.s. tight Hamilton cycles in random r-uniform hypergraphs with edge probability at least C log3 n/n…”
Get full text

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs by Dyer, Martin, Heinrich, Marc, Jerrum, Mark, Müller, Haiko

“…We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph…”
Get full text

Dicke State Quantum Search for Solving the Vertex Cover Problem by Jiang, Jehn-Ruey

“…This paper proposes a quantum algorithm, named Dicke state quantum search (DSQS), to set qubits in the Dicke state |Dkn…”
Get full text

Bounds on skyline probability for databases with uncertain preferences by Pujari, Arun K., Padmanabhan, Vineet, Kagita, Venkateswara Rao

“… We use this technique to estimate the skyline probability of an object and propose a polynomial-time algorithm for computing sharp upper bound…”
Get full text

An asymptotically optimal algorithm for online stacking by Olsen, Martin, Andersen, Lars Nørvang, Gross, Allan

“… We look into the problem of deciding where to put an arriving item with the objective of minimizing the maximum number of stacks used over time…”
Get full text

On the Minimax Misclassification Ratio of Hypergraph Community Detection by Chien, I Eli, Lin, Chung-Yi, Wang, I-Hsiang

“…Community detection in hypergraphs is explored. Under a generative hypergraph model called "<inline-formula> <tex-math notation="LaTeX">d…”
Get full text

Ant inspired Monte Carlo algorithm for minimum feedback arc set by Kudelić, Robert, Ivković, Nikola

“… Set in polynomial time with arbitrary probability. To further advance the state of the art we have devised new and improved ant inspired Monte Carlo algorithm which on average has 20…”
Get full text

The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs by Alon, Yahav, Anastos, Michael

“…(d6e−3d)$$ f(d)=\frac{1}{2}d{e}^{-d}+{e}^{-d}+O\left({d}^6{e}^{-3d}\right) $$ such that, if G∼G(n,p)$$ G\sim G\left(n,p\right) $$ with 20≤d(n)≤0.4logn$$ 20\le d(n)\le 0.4\log n $$, then with high probability…”
Get full text

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment by Wang, Ziao, Zhang, Ning, Wang, Weina, Wang, Lele

“… This motivates us to investigate efficient algorithms with theoretical performance guarantee. In this paper, we propose two polynomial-time algorithms that exactly recover the vertex correspondence with high probability…”
Get full text

How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems by Hevia Fajardo, Mario Alejandro, Lehre, Per Kristian

“…Competitive co-evolutionary algorithms (CoEAs) do not rely solely on an external function to assign fitness values to sampled solutions…”
Get full text

Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits by Coble, Nolan J., Coudron, Matthew

“… to [3]. The previous best known algorithm for this problem used O(2^{n^{1/3}}\text{poly}(1/\epsilon)) time to compute probabilities to within additive error…”
Get full text

MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems by Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul

“…Let V be a set of n vertices, M a set of m labels, and let R be an m × n matrix ofs independent Bernoulli random variables with probability of success p…”
Get full text

Maximum Box Problem on Stochastic Points by Caraballo, Luis E., Pérez-Lantero, Pablo, Seara, Carlos, Ventura, Inmaculada

“… We consider that each point of the input has a probability of being present in the final random point set, and these events are mutually independent…”
Get full text

Approximation algorithm for estimating failure probability of multipath transmission by Zhong, Sheng, Zhang, Yuan

“… Therefore, we design a polynomial-time approximation algorithm for estimating this failure probability and give analysis of its error bounds…”
Get full text

Non-quantum cryptanalysis of the noisy version of Aaronson–Christiano's quantum money scheme by Conde Pena, Marta, Durán Díaz, Raul, Faugère, Jean-Charles, Hernández Encinas, Luis, Perret, Ludovic

“…|≠2, that runs in randomised polynomial time. This finding is supported with experimental results showing that, in practice, the algorithm presented is efficient and succeeds with overwhelming probability…”
Get full text