Results 11 to 20 of about 73,753 (309)
Polynomial time algorithm for solving cyclic games [PDF]
Computer Science Journal of Moldova, 2003 The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.
Dmitrii Lozovanu
doaj +1 more source
Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs
AlgorithmsWe develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj +2 more sources
Polynomial-time algorithms for permutation groups [PDF]
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980 A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time.
Furst, Merrick +2 more
openaire +1 more source
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case [PDF]
Journal of Complexity, 2015 Published in Journal of Complexity, Elsevier, 2015, pp ...
Berthomieu, Jérémy +2 more
openaire +4 more sources
Approximate cycles count in undirected graphs [PDF]
International Journal of Computational Intelligence Systems, 2014 In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to
Maytham Safar +5 more
doaj +1 more source
Efficient CSL Model Checking Using Stratification [PDF]
Logical Methods in Computer Science, 2012 For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996.
Lijun Zhang +3 more
doaj +1 more source
A max-flow algorithm for positivity of Littlewood-Richardson coefficients [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group $\mathrm{GL}(n,\mathbb{C})$.
Peter Bürgisser, Christian Ikenmeyer
doaj +1 more source
Polynomial time constructive decision algorithm for multivariable quantum signal processing [PDF]
QuantumQuantum signal processing (QSP) and quantum singular value transformation (QSVT) have provided a unified framework for understanding many quantum algorithms, including factorization, matrix inversion, and Hamiltonian simulation.
Yuki Ito +3 more
doaj +1 more source
Practical polynomial factoring in polynomial time [PDF]
, 2010 State of the art factoring in Q[x] is dominated in theory by a combinatorial reconstruction problem while, excluding some rare polynomials, performance tends to be dominated by Hensel lifting.
Andrew Novocin +7 more
core +1 more source
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