In this paper, we investigate several algorithmic and complexity-theoretic topics regarding Tarski's fixed point theorem.
Schur convexity was introduced by Schur in 1923 [6], and it has many important applications in analytic inequalities [7 12], linear regression [13], graphs and matrices [14], combinatorial optimization [15], information-theoretic topics [16], Gamma functions [17], stochastic orderings [18], reliability [19], and other related fields.
Based on this framework, in Section 4 we discuss the emerging research issues in the aspects of Internet finance governance, theoretic research topics, and technological challenges, particularly regarding the big data based credit system in the Internet finance era.
To engage this, we have to model competition internally by using a game-theoretic method, a topic we are now turning to.
Thus, the stability problem of delayed neural networks has become a topic of great theoretic and practical importance.
Therefore, the stability analysis for delayed impulsive CGNNs has become a topic of great theoretic and practical importance in recent years [2 6].
The idea is to situate the mathematics of set theoretic circularity inside a larger topic, coalgebra, and then to understand both points in terms of a larger division between "bottom-up" and "top-down" ideas.
In recent years, the stability problem of time-delay NNs has become a topic of great theoretic and practical use importance due to the fact that inherent time delays and unavoidable parameter uncertainties are all well known to many biological and artificial NNs because of the finite speed of information processing as well as the NNs parameter fluctuations of the hardware implementation.
Coordination was, indeed, the first topic of game-theoretic application that came to the widespread attention of philosophers.
In the previous section we have already presented some results relative to this topic for Information-theoretic measures.
