Unverified Commit 762b1082 authored by abc1763613206's avatar abc1763613206 Committed by GitHub
Browse files

Merge pull request #1227 from StudyingFather/master 

修复失效链接
parents 74ea8d5d 7f8f7903

docs/math/poly/inv.md

+2 −2
Original line number Diff line number Diff line
@@ -35,7 +35,7 @@ $$T\left(n\right)=T\left(\frac{n}{2}\right)+O\left(n\log{n}\right)=O\left(n\log{ 


### Newton's Method



参见 [**Newton's Method**](../poly-newton/#inv).

参见 [**Newton's Method**](/math/poly/newton/#newtons-method).



## Code
@@ -71,4 +71,4 @@ $$T\left(n\right)=T\left(\frac{n}{2}\right)+O\left(n\log{n}\right)=O\left(n\log{ 


## Examples



1. 有标号简单无向连通图计数：[「poj 1737」Connected Graph](http://poj.org/problem?id=1737)
 
1. 有标号简单无向连通图计数：[「POJ 1737」Connected Graph](http://poj.org/problem?id=1737)

docs/math/poly/ln-exp.md

+1 −1
Original line number Diff line number Diff line
@@ -47,7 +47,7 @@ $$\left(n+1\right)\left[x^{n}\right]\exp{f\left(x\right)}=\sum_{i=0}^{n-1}\left[ 


### Newton's Method



使用 [**Newton's Method**](../poly-newton/#exp) 即可在 $O\left(n\log{n}\right)$ 的时间复杂度内解决多项式 $\exp$。

使用 [**Newton's Method**](/math/poly/newton/#newtons-method) 即可在 $O\left(n\log{n}\right)$ 的时间复杂度内解决多项式 $\exp$。



## Code

docs/math/poly/sqrt.md

+1 −1
Original line number Diff line number Diff line
@@ -32,7 +32,7 @@ $$T\left(n\right)=T\left(\frac{n}{2}\right)+O\left(n\log{n}\right)=O\left(n\log{ 


### Newton's Method



参见 [**Newton's Method**](../poly-newton/#sqrt).

参见 [**Newton's Method**](/math/poly/newton/#newtons-method).



## Examples