Advanced Search Results For "POLYNOMIAL time algorithms"

Link copied!

Publication Type: Academic Journal

Source(s): Computers, Materials & Continua. 2023, Vol. 74 Issue 3, p6755-6774. 20p.

Abstract: Software needs modifications and requires revisions regularly. Owing to these revisions, retesting software becomes essential to ensure that the enhancements made, have not affected its bug-free functioning. The time and cost incurred in this process, ...

Publication Type: Academic Journal

Source(s): Journal of the ACM. Nov2022, Vol. 69 Issue 6, p1-41. 41p.

Abstract: The existence of simple uncoupled no-regret learning dynamics that converge to correlated equilibria in normal-form games is a celebrated result in the theory ofmulti-agent systems. Specifically, it has been known for more than 20 years that when all p...

Publication Type: Academic Journal

Source(s): Journal of the ACM. Nov2022, Vol. 69 Issue 6, p1-19. 19p.

Abstract: We give an nO(log log n)-time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over {±1}n. Even in the realizable setting, the previous fastest runtime was nO(log n), a consequence of a cla...

Publication Type: Academic Journal

Source(s): Discussiones Mathematicae: Graph Theory. 2023, Vol. 43 Issue 1, p115-135. 21p.

Abstract: For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2,..., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the ...

Publication Type: Academic Journal

Source(s): Journal of the ACM. Sep2022, Vol. 69 Issue 5, p1-88. 88p.

Abstract: We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This is an argument of knowledge with the following three efficiency properties for computing and proving a (non-deterministic, polynomial time) parallel RAMcomputation...

Publication Type: Academic Journal

Source(s): Computational Intelligence & Neuroscience. 10/22/2022, p1-11. 11p.

Abstract: 0-1 Knapsack problem (KP) is NP-hard. Approximate solution is vital for solving KP exactly. In this paper, a fast polynomial time approximate solution (FPTAS) is proposed for KP. FPTAS is a local search algorithm. The best approximate solution to KP ca...

Publication Type: Academic Journal

Source(s): Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 4, p1139-1162. 24p.

Abstract: Let G = (V, E) be a finite undirected graph. An edge subset E' ⊆ E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E'. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i...

Publication Type: Academic Journal

Source(s): Computational Intelligence & Neuroscience. 9/12/2022, p1-11. 11p.

Abstract: Laboratory equipment planning is a very important task in modern enterprise management. Laboratory equipment planning by computer algorithm is a very complex NP-hard combinatorial optimization problem, so it is impossible to find an accurate algorithm ...

Publication Type: Academic Journal

Source(s): Computational Intelligence & Neuroscience. 9/7/2022, p1-12. 12p.

Abstract: This work explains why and how QoS modeling has been used within a multicriteria optimization approach. The parameters and metrics defined are intended to provide a broader and, at the same time, more precise analysis of the issues highlighted in the w...

Publication Type: Academic Journal

Source(s): Computational Intelligence & Neuroscience. 8/31/2022, p1-16. 16p.

Abstract: The quota traveling salesman problem (QTSP) is a variant of the traveling salesman problem (TSP), which is a classical optimization problem. In the QTSP, the salesman visits some of the n cities to meet a given sales quota Q while having minimized trav...