User contributions for Etone

Results for Etone talk block log uploads logs
A user with 1,224 edits. Account created on 30 August 2022.
Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View ( | ) (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 problems Created 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 formula Created 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

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Special:Contributions/Etone"