Results 21 to 30 of about 1,148,447 (292)
Walailak Journal of Science and Technology, 2019 This paper consists of proposal of two constructions of balanced Boolean functions by using powers of primitive elements ...
Dheeraj Kumar Sharma, Rajoo Pandey
doaj +1 more source
On computing nullspace bases - a fault detection perspective [PDF]
, 2008 We discuss computationally efficient and numerically reliable algorithms to compute minimal proper nullspace bases of a rational or polynomial matrix.
Andras Varga, Varga, Andreas
core +1 more source
A Computational Model for q-Bernstein Quasi-Minimal Bézier Surface
Journal of Mathematics, 2022 A computational model is presented to find the q-Bernstein quasi-minimal Bézier surfaces as the extremal of Dirichlet functional, and the Bézier surfaces are used quite frequently in the literature of computer science for computer graphics and the ...
Daud Ahmad +5 more
doaj +1 more source
Note on the smallest root of the independence polynomial [PDF]
, 2013 One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core +1 more source
Formalizing Termination Proofs under Polynomial Quasi-interpretations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a connection to the
Naohi Eguchi
doaj +1 more source
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas [PDF]
, 2011 This is a preprint version of the article - Copyright @ 2011 ElsevierA program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ.
Laurence, MR +10 more
core +1 more source
A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem [PDF]
, 1973 Elsner L. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem. Numerische Mathematik. 1973;21(5):425-427.By using Gershgorin's theorem and the theorems on minimal Gershgorin disks a posteriori error bounds for the ...
Elsner, Ludwig
core +1 more source
Minimal polynomials of singular moduli [PDF]
Mathematics of Computation, 2013 Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In both cases there are known algorithms for algebraically computing the rational norms of the singular moduli without relying on the the recognition of a decimal or
openaire +3 more sources
IEEE Access, 2022 Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
Polynomials Generating Maximal Real Subfields of Circular Fields [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2016 We have constructed recurrence formulas for polynomials qn(x) ɕ Q[x], any root of which generates the maximal real subfield of circular field K2n. It has been shown that all real subfields of fixed field K2n can be described by using polynomial qn(x) and
I.G. Galyautdinov, E.E. Lavrentyeva
doaj