搜索资源列表
-
0下载：
In mathematics, the discrete Fourier transform (DFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DFT, of the original function
-
-
0下载：
The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra
-
-
0下载：
The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra
-
-
0下载：
This book is intended to serve both as a textbook for a senior-level undergraduate course, and as a reference for practitioners. Readers should know enough discrete mathematics to understand “big-O” notation, and what it means for a problem to be NP-
-
-
0下载：
中山大学离散数学-数理逻辑课程讲义，周晓聪版-Zhongshan university discrete mathematics-mathematical logic course notes, ZhouXiaoCong version
-
-
0下载：
第1卷，涵盖了基本的原则和技术，形式化方法和抽象造型。首先，这本书提供了一个良好的，但简单的基础上洞察离散数学：号码，电视机， cartesians ，类型，功能，的lambda演算，代数，数理逻辑。那么列车，其读者的基本财产和示范导向的规范原则和技巧。示范导向的观念，是共同的，如语言规范包括b ， vdm的-晚上八时，和z是解释，在这里用提高规范语言（出rsl ） 。这本书则涵盖的基本原则的应用（功能） ，势在必行，并发（并行）的规格规划。最后，卷载有一个全面的词汇，软件工程等，以及大量的索引
-
-
0下载：
这是一个C++编的Dijkstra算法，用于离散数学中求最短路径的问题。-This is a C++ compiled Dijkstra algorithm for shortest path problems in discrete mathematics.
-
