Results 41 to 50 of about 17,779,829 (249)
The bounded complexity function versus the unbounded complexity function
Journal of Mathematical Analysis and Applications, 2012 Abstract We construct two point-wise periodic flows which are equivalent, such that all the complexity functions of one flow are bounded while the other flow has an unbounded complexity function.
Cheng Zhang, Wenxiang Sun, Sheng Qian
openaire +2 more sources
On the Trigonometric and p-Trigonometric Functions of Elliptical Complex Variables
Communications in Advanced Mathematical Sciences, 2020 In the early 2000s, the geometry of a one-parameter family of generalized complex number systems was studied (Math. Mag. 77(2)(2004)). This family is denoted by Cp.
Kahraman Esen Özen
doaj +1 more source
Charge distribution functions for characterization of complex systems
Хімія, фізика та технологія поверхні, 2021 A set of characteristics calculated within the scope of quantum chemistry methods may be assigned to local ones changing from atom to atom in complex systems. Simple averaging of the related values gives rather poor characteristics of the systems because
V. M. Gun’ko
doaj +1 more source
Computational complexity of functions
Theoretical Computer Science, 1996 Partial translation from [Levin 74]; preliminary version is in [Levin 73]
openaire +3 more sources
Alguns estudos de fluxo de fluido utilizando software gráfico
Revista Brasileira de Ensino de FísicaAnalisamos alguns modelos de fluxo de fluido utilizando o software gráfico F(C): Funções Complexas. Descrevemos as equações que expressam o potencial complexo, bem como a velocidade complexa para cada modelo.
Edvaldo Lima da Silva +2 more
doaj +1 more source
Complex pectin metabolism by gut bacteria reveals novel catalytic functions
Nature, 2017 The metabolism of carbohydrate polymers drives microbial diversity in the human gut microbiota. It is unclear, however, whether bacterial consortia or single organisms are required to depolymerize highly complex glycans.
D. Ndeh +24 more
semanticscholar +1 more source
On subword complexity functions
Discrete Applied Mathematics, 1984 The author finds a polynomial formula for the subword complexity function of a cyclic language. A characterization of context-free languages with exponential subword complexity is derived by appropriately using the pumping lemma.
openaire +3 more sources
On the complexity of slice functions
Theoretical Computer Science, 1985 By results of Razborov negations can be very powerful for Boolean circuits. But for the class of slice functions negations are almost powerless. Hence each hard function has a hard slice. Lower bounds on the monotone circuit complexity of slice functions imply lower bounds on the circuit complexity of these functions.
openaire +3 more sources
On the Complexity of Real Functions [PDF]
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005 We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS computability [Blum, Cucker, Shub, Smale 1998], and bit computability in the tradition of computable analysis ...
openaire +3 more sources
Convolution powers of complex functions on Z [PDF]
, 2012 Repeated convolution of a probability measure on Z leads to the central limit theorem and other limit theorems. This paper investigates what kinds of results remain without positivity. It reviews theorems due to Schoenberg, Greville, and Thomée which are
P. Diaconis, L. Saloff‐Coste
semanticscholar +1 more source