Results 31 to 40 of about 1,148,447 (292)
On the relative proof complexity of deep inference via atomic flows [PDF]
Logical Methods in Computer Science, 2015 We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Anupam Das
doaj +1 more source
The group and the minimal polynomial of a graph
Journal of Combinatorial Theory, Series B, 1980 AbstractThis paper presents some results linking the minimal polynomial of the adjacency matrix of a graph with its group structure. An upper bound on the order of the group is derived for graphs whose minimal and characteristic polynomials are identical.
CRISCUOLO, GIOVANNI +3 more
openaire +4 more sources
The structure of solutions of the matrix linear unilateral polynomial equation with two variables
Karpatsʹkì Matematičnì Publìkacìï, 2017 We investigate the structure of solutions of the matrix linear polynomial equation $A(\lambda)X(\lambda)+B(\lambda)Y(\lambda)=C(\lambda),$ in particular, possible degrees of the solutions.
N.S. Dzhaliuk, V.M. Petrychkovych
doaj +1 more source
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
SIMETRISASI BENTUK KANONIK JORDAN
Barekeng, 2021 If the characteristic polynomial of a linear operator is completely factored in scalar field of then Jordan canonical form of can be converted to its rational canonical form of , and vice versa.
Darlena Darlena, Ari Suparwanto
doaj +1 more source
Numerical computation of minimal polynomial bases: A generalized resultant approach [PDF]
, 2005 We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F(s). The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to ...
Vardulakis, Antonis +8 more
core +1 more source
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2020 The paper proposes a method for constructing primitive polynomials that are used in the design of radio engineering systems, subsystems of cryptographic information protection in reliable automated information processing and control systems at critical ...
Г.М. Гулак
doaj +1 more source
Partial stability of linear systems with respect to a given component of the phase vector
Журнал Средневолжского математического общества, 2021 A new geometric approach to the study of the partial stability of linear systems is proposed, which is based on the application of the geometric theory of linear operators.
Nikonov Vladimir I.
doaj +1 more source
Polynomial Delay Algorithm for Minimal Chordal Completions [PDF]
, 2022 Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In [Carmeli et al., 2020] (Pods 2017) Carmeli et al.
Mary, Arnaud +2 more
core +1 more source
Polynomial asymptotic stability of damped stochastic differential equations. [PDF]
, 2004 The paper studies the polynomial convergence of solutions of a scalar nonlinear Itˆo stochastic differential equation dX(t) = −f(X(t)) dt + (t) dB(t) where it is known, a priori, that limt!1 X(t) = 0, a.s. The intensity of the stochastic perturbation
D. Mackey +3 more
core +3 more sources