Results 21 to 30 of about 47,064 (164)
Detrended fluctuation analysis based on best-fit polynomial
Frontiers in Environmental Science, 2022 Detrended fluctuation analysis (DFA) can quantify long-range correlation (LRC) and fractal scaling behavior of signal. We compared the results of variant DFA methods by varying the order of the polynomial and found that the order of 6 was relatively ...
Shanshan Zhao +5 more
doaj +1 more source
A Batching Machine Model for Lot Scheduling on a Single Machine
Foundations of Computing and Decision Sciences, 2018 A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized.
Kovalyov Mikhail Y.
doaj +1 more source
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial time.
Felix Canavoi +2 more
doaj +1 more source
Critical Slowing Down in Polynomial Time Algorithms [PDF]
Physical Review Letters, 2001 4 pp., 3 ...
openaire +3 more sources
Analysis of Polynomial Time and Non-Polynomial Time of Algorithms
International Journal for Research in Applied Science and Engineering Technology, 2023 Abstract: The P vs NP problem is one of the most significant open problems in computer science and mathematics. This problem asks whether every problem that can be solved in polynomial time can also be verified in polynomial time. The purpose of this research paper is to explore the P vs NP problem and its relevance in the analysis of algorithms.
openaire +1 more source
Graph Operations and Neighborhood Polynomials
Discussiones Mathematicae Graph Theory, 2021 The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj +1 more source
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source
Polynomial time algorithm for checking strong equivalence of program
Труды Института системного программирования РАН, 2018 To unify a pair of algebraic expressions t1 and t2 is to find out such a substitution θ that both terms t1θ and t2θ have the same meaning. Unification problem can be extended to computational programs.
T. A. Novikova, V. A. Zakharov
doaj +2 more sources
Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm [PDF]
Engineering and Technology Journal, 2012 Factoring is very important in the field of cryptography, specifically in the Rivest, Shamir, Adleman(RSA) public-key cryptosystem, one of the most prevalent methods for transmitting and receiving secret data which its security relies on the fact that ...
Jamal A. Othman
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source