2018年01月_MyLinChi

06月 05月 04月 03月 02月 01月

原创矩阵运算

矩阵的基本性质 1.逆：n×nn\times n矩阵AA的逆A−1A^{-1}（如果存在）定义为满足AA−1=In=A−1AAA^{-1}=I_n=A^{-1}A的n×nn\times n的矩阵。若矩阵AA有逆，则称AA为可逆矩阵或者非奇异矩阵；否则称AA为不可逆矩阵或者奇异矩阵。 2.线性相关：若存在不全为0的相关系数c1,c2,...,cnc_1,c_2,...,c_n使得c1x1+c2x

2018-01-30 15:55:33 917

原创求解分治算法的递推关系

相关概念分治递推关系：如果f(n)f(n)表示求解规模为nn的问题所需的云算数，则ff满足递推关系 f(n)=af(n/b)+g(n)f(n)=af(n/b)+g(n)相关定理【定理1】设ff是满足递推关系 f(n)=af(n/b)+cf(n)=af(n/b)+c 的增函数，其中nn被bb整除,b≥1,bb\geq 1,b是大于1的正整数，cc是一个正实数。那么 f(n)={O(

2018-01-23 18:41:02 3602

原创求解线性递推关系

相关概念线性递推关系：一个常系数的k阶线性齐次递推关系是形如 an=c1an−1+c2an−2+...+ckan−ka_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} 的递推关系，其中c1,c2,...,ckc_1,c_2,...,c_k是实数且ck≠0c_k \neq 0。该定义中的递推关系是线性的，因为它的右边是序列前项的倍数。该递推关系是齐次的，因为所

2018-01-23 15:15:01 6440

原创 python学习常见问题

格式对齐问题在python中同一个块的每一行前面缩进必须一样，否则就会报IndentationError: unexpected indent的错误。如：def print_two(*args): ①arg1,arg2 = args ②print "arg1:%r,arg2:%r" % (arg1,arg2)①和②要么用同样数量的空格，要么都用Tab键，但两者不能

2018-01-17 18:58:49 932

原创图灵停机问题(halting problem)

问题描述是否存在一个过程能做这件事：该过程以一个计算机程序以及该程序的一个输入作为输入，并判断该过程在给定输入运行时是否最终能停止。问题解答 1936年图灵证明这样的过程是不存在的。证明（反证法）假设：存在一个这样的过程H（P,I），P为计算机程序，I为该程序的一个输入,H可以根据P和I返回true（该过程在给定输入运行时能停止)或者false（该过程在给定输入运行时不能停止）。

2018-01-12 15:00:57 7835

原创算法导论26.1-4

26.1-4问题描述设ff为网络的一个流，设α\alpha为一个实数，则αf\alpha f称为标量流积，该标量流积是一个从V×VV\times V到R的一个函数，其定义如下： (αf)(u,v)=α⋅f(u,v)(\alpha f)(u,v)=\alpha \cdot f(u,v) 证明：网络中的流形成一个凸集。也就是说，证明：如果f1f_1和f2f_2为两个流，则αf1+(1−α

2018-01-09 10:37:50 1583

原创用C语言实现基于二叉搜索树的时钟管理程序

二叉搜索树具有平均操作时间复杂度为O(lgn)的优点，其实现的主要难点在删除操作。项目中需要给一些任务设定超时机制，因此需要用到时钟管理。但平台使用的是c语言，因为没有引用，实现起来特别麻烦（要涉及三重指针）。一下是程序部分：#define _CRT_SECURE_NO_WARNINGS#include#include#define i32 int#define u32 unsigne

2018-01-04 19:56:18 378

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them. In Part II, we present linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primaldual schema. But once again, the exact approximation guarantee obtainable depends on the specific LP-relaxation used, and there is no fixed recipe for discovering good relaxations, just as there is no fixed recipe for proving a theorem in mathematics (readers familiar with complexity theory will recognize this as the philosophical point behind the P -=/= NP question).

2020-04-26