Results 21 to 30 of about 1,746,055 (248)
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
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
On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality [PDF]
QuantumThe simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in simulating ...
Kazuki Sakamoto, Keisuke Fujii
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
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
IEEE Access, 2020 In the context of chaotic secure communication, this paper is concerned with the predefined-time polynomial-function-based synchronization of chaotic systems via sliding mode control.
Qiaoping Li, Chao Yue
doaj +1 more source
Journal of Mathematical Cryptology, 2022 We investigate the problem of recovering integer inputs (up to an affine scaling) when given only the integer monotonic polynomial outputs. Given nn integer outputs of a degree-dd integer monotonic polynomial whose coefficients and inputs are integers ...
Vivek Srinivas +2 more
doaj +1 more source
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
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
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