组合数学 (Fall 2023)/Existence problems: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

18 April 2023

  • curprev 12:5612:56, 18 April 2023‎ Etone talk contribs‎ 14,440 bytes +14,440‎ 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..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2023)/Existence_problems"