Titlebook: Concise Computer Mathematics; Tutorials on Theory Ovidiu Bagdasar Book 2013 The Author(s) 2013 Computational Mathematics.Discrete Mathemat

malcontented

書目名稱Concise Computer Mathematics影響因子(影響力)




書目名稱Concise Computer Mathematics影響因子(影響力)學(xué)科排名




書目名稱Concise Computer Mathematics網(wǎng)絡(luò)公開度




書目名稱Concise Computer Mathematics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Concise Computer Mathematics被引頻次




書目名稱Concise Computer Mathematics被引頻次學(xué)科排名




書目名稱Concise Computer Mathematics年度引用




書目名稱Concise Computer Mathematics年度引用學(xué)科排名




書目名稱Concise Computer Mathematics讀者反饋




書目名稱Concise Computer Mathematics讀者反饋學(xué)科排名

semble

Relations and Databases,present some of the general properties of relations and their operations, as well some special types of relations defined over the same set. A good command of these basic notions is essential for understanding the relational database theory, where a relation is a set of tuples . and each element . i

Feedback

細(xì)絲

Boolean Algebra, Logic and Quantifiers,ich have the truth values true and false (sometimes denoted 1 and 0 respectively). In this chapter the main operations of Boolean algebra (conjunction (AND, .), disjunction (OR, .) and negation (NOT, .)) are defined, and statements involving logical variables are studied with the aid of truth tables

paleolithic

Trochlea

Trochlea

Matrices and Applications,eralisations of vectors and play a key role in many mathematical areas such as linear algebra or computer graphics (where they are used to define linear transformations). In this chapter we define matrices and illustrate their properties through examples. We then present some basic matrix operations

孵卵器

Matrix Applications in Computer Graphics,ices allow arbitrary linear transformations to be represented in a consistent format (. for some . (or .) matrix ., called the transformation matrix of T), suitable for computation. This format allows transformations to be conveniently combined with each other by multiplying their matrices. In this

抑制

Elements of Graph Theory,lem was the famous Konigsberg Problem solved by Leonhard Euler. He proposed a model which reduced the problem to a schematic diagram and then concluded that the graph needed to satisfy some general conditions for the problem to be solved affirmatively. His studies highlighted the importance of under

粗野

Elements of Number Theory and Cryptography, emerged from the need of solving more complicated equations. However, numerous fundamental (some still unanswered) questions in mathematics refer to prime numbers and their properties (Goldbach conjecture, Rieman hypothesis). Cryptography studies techniques for a secure communication in the presenc