Results 21 to 30 of about 531,507 (259)
Number of sequences with given linear complexity profiles
Tongxin xuebao, 2006 For given monotonically increasing nonnegative integral sequence （L1, L2,… , Ln）, the number of sequences of length n with linear complexity profiles （L1, L2, …, Ln） was provided.
LIU Xun-shou, QI Wen-feng
doaj +2 more sources
On the Linear Complexity of New Generalized Cyclotomic Binary Sequences of Order Two and Period pqr
Tsinghua Science and Technology, 2016 Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudorandom properties.
Longfei Liu +3 more
doaj +1 more source
Linear viscoelasticity of complex coacervates
Advances in Colloid and Interface Science, 2017 The final published version can be found here: http://dx.doi.org/10.1016/j.cis.2016.08 ...
Liu, Yalin +2 more
openaire +4 more sources
The Complexity of Datalog on Linear Orders [PDF]
Logical Methods in Computer Science, 2009 We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIME-complete.
Martin Grohe, Goetz Schwandtner
doaj +1 more source
The proof complexity of linear algebra
Annals of Pure and Applied Logic, 2003 The authors analyze the complexity of the concepts needed to prove the basic theorems of linear algebra. One of the important results obtained in this paper is that the Cayley-Hamilton theorem enjoys a feasible proof. The analysis is carried out by making use of three formal theories, each of which is carefully designed so as to examine the basic ...
Michael Soltys, Stephen A. Cook
openaire +2 more sources
Algorithmic complexity of linear nonassociative algebra
Вестник КазНУ. Серия математика, механика, информатика, 2020 One of the central problems of algebraic complexity theory is the complexity of multiplication in algebras. For this, first, the concept of algebra is defined and the class of algebras under study is fixed.
R. K. Kerimbaev +2 more
doaj +1 more source
Linearization: Geometric, Complex, and Conditional [PDF]
Journal of Applied Mathematics, 2012 Lie symmetry analysis provides a systematic method of obtaining exact solutions of nonlinear (systems of) differential equations, whether partial or ordinary. Of special interest is the procedure that Lie developed to transform scalar nonlinear second‐order ordinary differential equations to linear form.
openaire +5 more sources
Generalized Joint Linear Complexity of Linear Recurring Multisequences [PDF]
, 2008 The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform.
Wilfried Meidl, Ferruh Özbudak
openaire +2 more sources
Linear complexity assertions for sorting [PDF]
IEEE Transactions on Software Engineering, 1994 Correctness of the execution of sorting programs can be checked by two assertions: the order assertion and the permutation assertion. The order assertion checks if the sorted data is in ascending or descending order. The permutation assertion checks if the output data produced by sorting is a permutation of the original input data.
Nirmal R. Saxena, Edward J. McCluskey
openaire +2 more sources
Solid Pseudopapillary Neoplasm of the Pancreas in Children and Adolescents: Expert Recommendations
Pediatric Blood &Cancer, EarlyView.ABSTRACT Solid pseudopapillary neoplasm of the pancreas (SPN) is a rare low‐grade malignant exocrine pancreatic tumor, mostly discovered during the second decade of life in females, with a very good prognosis, provided microscopically complete surgical excision is achieved.
Sabine Irtan +18 more
wiley +1 more source