Results 41 to 50 of about 47,064 (164)
Unification Algorithms Cannot Be Combined in Polynomial Time
Information and Computation, 1996 We establish that there is no polynomial-time general combination algorithm for unification in finitary equational theories, unless the complexity class #P of counting problems is contained in the class FP of function problems solvable in polynomial-time. The prevalent view in complexity theory is that such a collapse is extremely unlikely for a number
Hermann, Miki, Kolaitis, Phokion G.
openaire +2 more sources
Polynomial Time Algorithms for Bichromatic Problems [PDF]
, 2017 In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested ...
Bandyapadhyay, Sayan, Banik, Aritra
openaire +2 more sources
An Improved Coppersmith Algorithm Based on Block Preprocessing
MathematicsSince Coppersmith proposed the use of the LLL algorithm to solve univariate modular polynomial equations at EUROCRYPT’96, it has sparked a fervent research interest in lattice analysis among cryptographers.
Lu Zhang +3 more
doaj +1 more source
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
Physical Review XWe provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational ...
Thomas Schuster +3 more
doaj +1 more source
Multi-threshold algorithm about image segmentation based on polynomial uniform approximation
Tongxin xuebao, 2016 Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using ...
Yan-jun WEI, Bo-qin FENG, Wei-guo WU
doaj +2 more sources
Ural Mathematical Journal, 2023 We develop the first fixed-ratio approximation algorithm for the well-known Prize-Collecting Asymmetric Traveling Salesman Problem, which has numerous valuable applications in operations research. An instance of this problem is given by a complete node-
Ksenia Rizhenko +2 more
doaj +1 more source
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
Undergraduate Journal of Mathematical Modeling: One + Two, 2012 The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj +1 more source
Robot Time-Optimal Trajectory Planning Based on Improved Cuckoo Search Algorithm
IEEE Access, 2020 The trajectory planning time is uncertain when there is no velocity constraint in the joint space of an operating robot. This paper proposes a 3-5-3 polynomial interpolation trajectory planning algorithm based on improved cuckoo search algorithm (ICS ...
Wenjie Wang +4 more
doaj +1 more source
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.
Maciej Gazda, Tim A.C. Willemse
doaj +1 more source
Polynomial time algorithm for solving k-coverage problem in wireless sensor networks
Dianxin kexue, 2017 How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,
Qi WANG, Zheng’an XIAO, Huaixing WANG
doaj +2 more sources