Results 31 to 40 of about 2,188,345 (345)
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
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Algorithms, 2021 Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.
David Schaller +3 more
doaj +1 more source
A polynomial-time algorithm for global value numbering [PDF]
Science of Computer Programming, 2004 AbstractWe describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non-deterministic and all program operators as uninterpreted. We show that there are programs for which the set of all equivalences contains terms whose value graph ...
Sumit Gulwani, George C. Necula
openaire +1 more source
Shortening the order of paraunitary matrices in SBR2 algorithm [PDF]
, 2007 The second order sequential best rotation (SBR2) algorithm has recently been proposed as a very effective tool in decomposing a para-Hermitian polynomial matrix R(z) into a diagonal polynomial matrix T(z) and a paraunitary matrix B(,z), extending the ...
Weiss, Stephan +5 more
core +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
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
Top Coefficients of the Denumerant [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2 x_2+
Velleda Baldoni +5 more
doaj +1 more source
A Polynomial-Time Algorithm for Near-Perfect Phylogeny [PDF]
SIAM Journal on Computing, 1996 Summary: A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from ``perfection''. This problem is shown to be solvable in polynomial time for any fixed value of the parameter.
David Fernández-Baca, Jens Lagergren
openaire +2 more sources
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
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