Results 21 to 30 of about 5,364,330 (300)
On the Complexity of Multiple Sequence Alignment [PDF]
Journal of Computational Biology, 1994 We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the first problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.
Lusheng Wang 0001, Tao Jiang 0001
openaire +2 more sources
Algorithm 898 : efficient multiplication of dense matrices over GF(2) [PDF]
, 2010 We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense matrices over the field with two elements (F-2). In particular we present our implementation in the M4RI library-of Strassen-Winograd matrix multiplication ...
Albrecht, Martin +5 more
core +1 more source
Multiplication polynomials and relative Manin-Mumford [PDF]
, 2015 After the introduction we prove in chapter 2 that the resultant of the standard multiplication polynomials $A_n,B_n$ of an elliptic curve in the form $y^2 = x^3+ax+b$ is $(16\Delta)^{{n^2(n^2-1) \over 6}}$, where $\Delta=-(4a^3+27b^2)$ is the ...
Schmidt, Harry
core +1 more source
Investigating generalized quaternions with dual-generalized complex numbers [PDF]
Mathematica Bohemica, 2023 We aim to introduce generalized quaternions with dual-generalized complex number coefficients for all real values $\alpha$, $\beta$ and $\mathfrak{p}$.
Nurten Gürses +2 more
doaj +1 more source
On the interrelation of multiplication and division in secondary school children
Frontiers in Psychology, 2013 Multiplication and division are conceptually inversely related: Each division problem can be transformed into as a multiplication problem and vice versa.
Stefan eHuber +4 more
doaj +1 more source
The complexity of iterated multiplication
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immerman, N, LANDAU, S
openaire +4 more sources
Complex Multiplication Model for Circular Regression
, 2022 In this chapter, we treat circular data as unit complex numbers and model their correlation by multiplying them in the complex plane. We propose a general complex multiplication framework for circular regression.
Zhan, Xiaoping +2 more
core +1 more source
Complexity and multiple complexes
Mathematische Zeitschrift, 1987 Let G be a finite group and let R be a commutative ring with unit. One of the most basic problems in group cohomology is that of finding suitable projective resolutions for RG-modules. The main result of this paper shows that if \(R=k\) is a field of characteristic \(p>0\), and if M is any finitely generated kG-module then there exists a projective ...
Carlson, Jon F., Benson, David J.
openaire +1 more source
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
Scalable set of reversible parity gates for integer factorization
Communications Physics, 2023 Classical microprocessors operate on irreversible gates, that, when combined with AND, half-adder and full-adder operations, execute complex tasks such as multiplication of integers.
Martin Lanthaler +2 more
doaj +1 more source