Results 1 to 10 of about 33,836 (264)
On the minimal distance of a polynomial code [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ...
Peter Pal Pach, Csaba Szabo
doaj +3 more sources
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thanh Minh Hoang, Thomas Thierauf
exaly +2 more sources
Minimal Polynomial Algorithms for Finite Sequences [PDF]
IEEE Transactions on Information Theory, 2010 We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.
Graham H Norton
exaly +5 more sources
Computing and using minimal polynomials [PDF]
Journal of Symbolic Computation, 2020 This is a fully revised version. To be published in Journal of Symbolic Computation, special Issue on Symbolic Computation and Satisfiability ...
John Abbott +3 more
openaire +4 more sources
A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences
Mathematics, 2022 A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence.
Musthofa +3 more
doaj +1 more source
On dynamics of asymptotically minimal polynomials
Journal of Approximation Theory, 2023 Minor revisions, to appear in Journal of Approximation ...
Turgay Bayraktar, Melike Efe
openaire +5 more sources
On the Ehrhart Polynomial of Minimal Matroids [PDF]
Discrete & Computational Geometry, 2021 AbstractWe provide a formula for the Ehrhart polynomial of the connected matroid of size n and rank k with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $$h^*$$ h ∗ -real-rooted (and hence ...
openaire +2 more sources
On the quantization of some polynomial minimal surfaces
Physics Letters B, 2021 A class of exact membrane solutions is quantized.
Jens Hoppe
doaj +1 more source
Cointegration, Root Functions and Minimal Bases
Econometrics, 2021 This paper discusses the notion of cointegrating space for linear processes integrated of any order. It first shows that the notions of (polynomial) cointegrating vectors and of root functions coincide.
Massimo Franchi, Paolo Paruolo
doaj +1 more source
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source