User contributions for Etone

A user with 1,025 edits. Account created on 30 August 2022.
Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View (newer 100 | ) (20 | 50 | 100 | 250 | 500)

15 April 2024

12 April 2024

9 April 2024

  • 13:2713:27, 9 April 2024 diff hist +14,440 N 组合数学 (Fall 2024)/Existence problemsCreated page with "== Existence by Counting == === Shannon's circuit lower bound=== This is a fundamental problem in in Computer Science. A '''boolean function''' is a function in the form <math>f:\{0,1\}^n\rightarrow \{0,1\}</math>. [http://en.wikipedia.org/wiki/Boolean_circuit Boolean circuit] is a mathematical model of computation. Formally, a boolean circuit is a directed acyclic graph. Nodes with indegree zero are input nodes, labeled <math>x_1, x_2, \ldots , x_n</math>. A circuit h..." current
  • 13:2613:26, 9 April 2024 diff hist +17,231 N 组合数学 (Fall 2024)/Cayley's formulaCreated page with "== Cayley's Formula == We now present a theorem of the number of labeled trees on a fixed number of vertices. It is due to [http://en.wikipedia.org/wiki/Arthur_Cayley Cayley] in 1889. The theorem is often referred by the name [http://en.wikipedia.org/wiki/Cayley's_formula Cayley's formula]. {{Theorem|Cayley's formula for trees| : There are <math>n^{n-2}</math> different trees on <math>n</math> distinct vertices. }} The theorem has several proofs, including the bijectio..." current
  • 13:2613:26, 9 April 2024 diff hist +87 组合数学 (Spring 2024)→‎Lecture Notes
  • 13:2413:24, 9 April 2024 diff hist +80 组合数学 (Spring 2024)→‎Lecture Notes

8 April 2024

27 March 2024

26 March 2024

25 March 2024

20 March 2024

19 March 2024

18 March 2024

  • 15:5115:51, 18 March 2024 diff hist +15,498 N 概率论与数理统计 (Spring 2024)/Karger's min-cut algorithmCreated page with "Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''disconnected'' after deleting all edges in <math>C</math>. Let <math>\{S,T\}</math> be a '''bipartition''' of <math>V</math> into nonempty subsets <math>S,T\subseteq V</math>, where <math>S\cap T=\emptyset</math> and <math>S\cup T=V</math>. A cut <math>C</math> is specified by this bipartition as :<math>C=E(S,T..."

13 March 2024

12 March 2024

  • 02:5602:56, 12 March 2024 diff hist +24,945 N QuantumCreated page with "= 量子算法与物理实现研讨会= ==时间地点 == *'''<font size=4> 2019年10月19、20日: 9 am--5 pm.</font>''' * <font size=4> 南京大学 计算机科学与技术系 (南京大学仙林校区常州楼)111报告厅</font> [http://map.baidu.com/?l=&s=s%26wd%3D南京仙林大道163号++南京大学(仙林校区)计算机系楼 在线地图] ==联系人与联系方式 == * 姚鹏晖 pyao@nju.edu.cn * 张利剑 lijian.zhang@nju.edu.cn ==会议主旨..." current

6 March 2024

4 March 2024

27 February 2024

26 February 2024

18 February 2024

3 December 2023

29 November 2023

  • 16:3316:33, 29 November 2023 diff hist +2,459 N Assignment 4, Fall 2023Created page with "在第四章中,我们从准地转近似下的纬向平均风场、温度场的趋势方程出发,定义了E-P通量。但是该定义下的E-P通量并没有考虑到大气湿过程的影响。如果从第三章介绍的水汽方程出发,我们可以按照以下步骤定义出一个包含大气大尺度运动中湿过程作用的广义的E-P通量。 1)在准地转近似下,如果我们按照对热力学方程的简化方法,将比湿(specific humidity..." current
  • 16:3316:33, 29 November 2023 diff hist +54 General Circulation(Fall 2023)→‎Assignments current

6 November 2023

(newest | oldest) View (newer 100 | ) (20 | 50 | 100 | 250 | 500)