Search Results - computational complexity and matrix polynomial

Efficient multiplication of a vector by an MDS matrix with irreducible characteristic polynomial.

Alternate Title: Multiplicación eficiente de un vector por una matriz MDS con polinomio característico irreducible.

Authors: Freyre Arrozarena, Pablo Cuellar Justiz, Oristela Rodríguez Aulet, Ramsés et al.

Source: Revista Cubana de Ciencias Informáticas. oct-dic2024, Vol. 18 Issue 4, p1-17. 17p.

Subject Terms: Matrix inversion, Matrix multiplications, Irreducible polynomials, Linear codes, Computational complexity

The Complexity of the Word-Problem for Finite Matrix Rings

Authors: Szabó, Csaba

Source: Proceedings of the American Mathematical Society, 2004 Dec 01. 132(12), 3689-3695.

Access URL: https://www.jstor.org/stable/4097353

Accurate Approximation of the Matrix Hyperbolic Cosine Using Bernoulli Polynomials.

Authors: Alonso, José M. Ibáñez, Javier Defez, Emilio et al.

Source: Mathematics (2227-7390). Feb2023, Vol. 11 Issue 3, p520. 22p.

Subject Terms: *BERNOULLI polynomials, *MATRIX exponential, *COMPUTATIONAL complexity, *BALANCE of payments, *MATRIX functions

Matrix Polynomial Factorization via Higman Linearization

Authors: Arvind, V. Joglekar, Pushkar S.

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/abs/2203.16978

Computational Complexity of Some Problems in Parametric Discrete Programming. I

Authors: Blair, C. E. Jeroslow, R. G.

Source: Mathematics of Operations Research, 1986 May 01. 11(2), 241-260.

Access URL: https://www.jstor.org/stable/3689807

Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices

Authors: Krishna, Bal Krishna, Hari

Source: SIAM Journal on Applied Mathematics, 1989 Aug 01. 49(4), 1275-1282.

Access URL: https://www.jstor.org/stable/2102018

A new non-commutative key exchange protocol on combinatorial semigroup.

Authors: Zhang, Jing Yang, Ya-Juan Bao, JingJing

Source: Automatika: Journal for Control, Measurement, Electronics, Computing & Communications. Dec2025, Vol. 66 Issue 4, p871-882. 12p.

Subject Terms: Cryptography, Quantum computing, Semigroups (Algebra), Abstract algebra, Key agreement protocols (Computer network protocols), Public key cryptography, Computational complexity

A NEW ALGORITHM FOR COMPUTING THE INVERSE AND GENERALIZED INVERSE OF THE SCALED FACTOR CIRCULANT MATRIX

Authors: Jiang, Zhaolin Xu, Zongben

Source: Journal of Computational Mathematics, 2008 Jan 01. 26(1), 112-122.

Access URL: https://www.jstor.org/stable/43693428

Low Complexity Polynomial Expansion Detector With Deterministic Equivalents of the Moments of Channel Gram Matrix for Massive MIMO Uplink.

Authors: Lu, An-An Gao, Xiqi Zheng, Yahong Rosa et al.

Source: IEEE Transactions on Communications. Feb2016, Vol. 64 Issue 2, p586-600. 15p.

Subject Terms: *COMPUTATIONAL complexity, *MIMO systems, *RICIAN channels, *RAYLEIGH fading channels, *POLYNOMIAL approximation, *OPERATOR-valued measures

Machine learning techniques for adaptive polynomial and neural network digital predistorters

Authors: López Bueno, David

Contributors: University/Department: Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions

Thesis Advisors: Gilabert Pinal, Pere Lluís, Montoro López, Gabriel

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: Àrees temàtiques de la UPC::Enginyeria de la telecomunicació, Àrees temàtiques de la UPC::Informàtica

Time: 621.3

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/690181
https://dx.doi.org/10.5821/dissertation-2117-403561

Complexity of constructing Dixon resultant matrix.

Authors: Qin, Xiaolin Wu, Dingxiong Tang, Lin et al.

Source: International Journal of Computer Mathematics. Oct2017, Vol. 94 Issue 10, p2074-2088. 15p.

Subject Terms: *Algorithms, *Multivariate analysis, Polynomials, Computational complexity, Automatic control systems

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices.

Authors: Malyshev, D.S. Gribanov, D.V.

Source: Discrete Optimization. Aug2018, Vol. 29, p103-110. 8p.

Subject Terms: Absolute value, Set theory, Graph theory, Geometric vertices, Polynomials, Matrices (Mathematics)

Riffle Rank.

Authors: Rossman, Benjamin¹ (AUTHOR) benjamin.rossman@duke.edu

Source: Procedia Computer Science. 2025, Vol. 273, p215-222. 8p.

Subject Terms: Circuit complexity, Tensor algebra, Computational complexity

New flexible deterministic compressive measurement matrix based on finite Galois field.

Authors: Kazemi, Vahdat Shahzadi, Ali Khaleghi Bizaki, Hossein

Source: IET Image Processing (Wiley-Blackwell); Jan2022, Vol. 16 Issue 1, p239-251, 13p

Subject Terms: FINITE fields, COMPRESSED sensing, COHERENCE (Optics), IMAGE processing, HADAMARD matrices, COMPUTATIONAL complexity

An Analysis of the Computational Complexity and Efficiency of Various Algorithms for Solving a Nonlinear Model of Radon Volumetric Activity with a Fractional Derivative of a Variable Order.

Authors: Tverdyi, Dmitrii

Source: Computation; Nov2025, Vol. 13 Issue 11, p252, 29p

Subject Terms: COMPUTATIONAL complexity, PARALLEL algorithms, FRACTIONAL calculus, CAUCHY problem, MATHEMATICAL optimization, NONLINEAR regression

Fast Minimum Variance Beamforming Based on Legendre Polynomials.

Authors: Bae, MooHo Park, Sung Bae Kwon, Sung Jae

Source: IEEE Transactions on Ultrasonics Ferroelectrics & Frequency Control; Sep2016, Vol. 63 Issue 9, p1422-1431, 10p

Subject Terms: BEAMFORMING, LEGENDRE'S polynomials, COMPUTATIONAL complexity, COVARIANCE matrices, MULTIPLE correspondence analysis (Statistics), CYSTS (Pathology)

Low-complexity polynomial channel estimation in large-scale MIMO with arbitrary statistics

Authors: Shariati, N. Björnson, Emil Bengtsson, M. et al.

Source: IEEE Journal on Selected Topics in Signal Processing. 8(5):815-830

Subject Terms: Channel estimation, large-scale MIMO, pilot contamination, polynomial expansion, spatial correlation

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-116369
https://liu.diva-portal.org/smash/get/diva2:798754/FULLTEXT01.pdf

TALL ARRAY METHOD EFFICIENCY IN DATASET DIMENSIONALITY REDUCTION BY PRINCIPAL COMPONENT ANALYSIS.

Alternate Title: ЕФЕКТИВНІСТЬ МЕТОДУ TALL ARRAY У ЗНИЖЕННІ РОЗМІРНОСТІ НАБОРІВ ДАНИХ НА ОСНОВІ МЕТОДУ ГОЛОВНИХ КОМПОНЕНТІВ.

Authors: Romanuke, Vadim V.¹ romanukevadimv@gmail.com

Source: KPI Science News. 2025, Vol. 139 Issue 2, p18-29. 12p.

Subject Terms: Time complexity, Principal components analysis, Data analytics, Computational complexity, Data analysis, Big data

MVDR broadband beamforming using polynomial matrix techniques

Authors: Alzin, Ahmed Weiss, Stephan

Contributors: Alzin, Ahmed Weiss, Stephan

Access URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.851760

A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors

Authors: Gerasoulis, A.

Source: Mathematics of Computation, 1988 Jan 01. 50(181), 179-188.

Access URL: https://www.jstor.org/stable/2007921