注册
登录
智慧物流
problem-solving-class-lectures
返回
项目作者:
courses-at-nju-by-hfwei
项目描述 :
Lectures for the "Problem Solving" Class at Nanjing University.
高级语言:
TeX
项目主页:
项目地址:
git://github.com/courses-at-nju-by-hfwei/problem-solving-class-lectures.git
创建时间:
2017-02-19T08:02:25Z
项目社区:
https://github.com/courses-at-nju-by-hfwei/problem-solving-class-lectures
开源协议:
MIT License
下载
symmetric_1648326763272.pdf
transitive_1648326763286.pdf
x2y2z2r2_1648326763306.pdf
xyzr_1648326763354.pdf
2019-1-final-exam-handout_1648326763419.pdf
2019-1-final-exam_1648326763535.pdf
2017-1-exam-handout_1648326763630.pdf
2017-1-exam_1648326763704.pdf
2019-2-10-data-structures-handout_1648326763854.pdf
2019-2-10-data-structures_1648326763904.pdf
after-compact-8_1648326763961.pdf
after-compact_1648326764038.pdf
before-compact_1648326764079.pdf
hoare-partition-example_1648326764113.pdf
2019-2-11-heapsort-handout_1648326764175.pdf
2019-2-11-heapsort_1648326764355.pdf
asymptotic-cases_1648326764513.pdf
heap-decreasing-order-7_1648326764556.pdf
heap-decreasing-order_1648326764597.pdf
heap-structure_1648326764641.pdf
heap-subtrees_1648326764687.pdf
heapsort-selection-best-12_1648326764733.pdf
heapsort-selection-worst-7_1648326764777.pdf
heapsort-selection-worst-8_1648326764823.pdf
heapsort-selection-worst_1648326764868.pdf
max-heapify-worst_1648326764895.pdf
2019-2-14-b-tree-handout_1648326765304.pdf
2019-2-14-b-tree_1648326765438.pdf
predecessor-191250145-王子鉴_1648326765581.pdf
2019-2-4-recurrences-handout_1648326765704.pdf
2019-2-4-recurrences_1648326765766.pdf
h-layout-2_1648326765859.pdf
h-layout_1648326765933.pdf
mss-proof_1648326765979.pdf
vlsi-binary-tree_1648326766045.pdf
2019-2-6-algorithmic-methods-handout_1648326766084.pdf
2019-2-6-algorithmic-methods_1648326766268.pdf
convex-polygon-antipodal-diameter_1648326766518.pdf
convex-polygon-vertex-diameter_1648326766533.pdf
2019-2-8-probabilistic-analysis-handout_1648326766617.pdf
2019-2-8-probabilistic-analysis_1648326767061.pdf
HHH-automaton_1648326767444.pdf
HHT-automaton_1648326767481.pdf
HT-pattern_1648326767496.pdf
HTH-automaton_1648326767512.pdf
THTTH-automaton_1648326767577.pdf
Tail call (wiki; 20191029)_1648326767856.pdf
JSTOR1947 The Counterfeit Coin Problem_1648326767928.pdf
SIAM J COMPUT1982 The Counterfeit Coin Problem Revisited (Average Case)_1648326767996.pdf
The General Counterfeit Coin Problem (math.uzh)_1648326768067.pdf
Two-pan Balance and Generalized Counterfeit Coin Problem (math.uni; Coding with exact number calculation)_1648326768155.pdf
Higher Order Functions (Learn You a Haskell for Great Good)_1648326768196.pdf
MSR-TR-2010-147 A Preliminary Survey of Functional Programming_1648326768255.pdf
An Elegant Pairing Function_1648326768324.pdf
Cardinality of the continuum (wiki 20191216)_1648326768343.pdf
Cardinality of the continuum (wiki 20191221)_1648326768430.pdf
Countable set (wiki 20191216)_1648326768508.pdf
Dimension theory (Encyclopedia of Mathematics)_1648326768605.pdf
Domain of Injection to Countable Set is Countable (ProofWiki 20191216)_1648326768678.pdf
Georg Cantor (wiki 20191216)_1648326768779.pdf
Georg Cantor first set theory article (wiki 20191221)_1648326768878.pdf
Infinity Operations on Cardinals (Professor Quibb Blog)_1648326769002.pdf
Integers are Countably Infinite (ProofWiki 20191216)_1648326769109.pdf
Pairing function (wiki 20191216)_1648326769195.pdf
Schroder–Bernstein theorem (wiki 20191216)_1648326769254.pdf
Was Cantor Surprised_1648326769327.pdf
arXiv2019 1904.09193 Cantor-Bernstein implies Excluded Middle_1648326769379.pdf
Some topics in Lattice theory (1948)_1648326769459.pdf
Arithmetical hierarchy (wiki)_1648326769610.pdf
Bulletin of Symbolic Logic2001 Second-Order Logic and Foundations of Mathematics_1648326769672.pdf
Logic Quantifier (wiki 20191014)_1648326769787.pdf
Many Valued Logic (Nicholas Smith, 2010)_1648326769900.pdf
Notices of AMS2008 Formal Proof_1648326770216.pdf
PPT2014 (Mario Joao Frade) FOL and SMT_1648326771451.pdf
Prenex normal form (csd.uwo.ca)_1648326771556.pdf
Prenex-normal-form (wiki)_1648326771868.pdf
The Emergence of First-Order Logic (Stanford Encyclopedia of Philosophy)_1648326771910.pdf
谈以演化计算思想做机器证明与推理的构想 (CSDN)_1648326771979.pdf
Proof Theory (Stanford Encyclopedia of Philosophy)_1648326772246.pdf
The History and Concept of Mathematical Proof (2007)_1648326772322.pdf
Recursive Function Theory (Peter Suber)_1648326772428.pdf
Closures of Relations_1648326772451.pdf
Construction of the Real Numbers (Elements of Set Theory; Herbert Enderton)_1648326772579.pdf
From Set Theory to Type Theory (The n-Category Cafe Blog; 2013)_1648326772859.pdf
Intuitions of Three Kinds in Godel Views on the Continuum (John Burgess)_1648326772971.pdf
PPT2018 (John Harrison) Lets Make Set Theory Great Again_1648326773061.pdf
Rethinking Set Theory (The n-Category Cafe; 2012 Blog)_1648326773164.pdf
Set Theory (Stanford Encyclopedia of Philosophy)_1648326773335.pdf
The Early Development of Set Theory (Stanford Encyclopedia of Philosophy)_1648326773393.pdf
arXiv2012 1212.6543 Rethinking Set Theory_1648326773484.pdf
Diameter and Width via Rotating Calipers of a Set of Twodimensional Convex Hull Vertices using Graham Scan Algorithm_1648326773570.pdf
Euclid Algorithm and the Fibonacci Numbers (Epasinghe 1983)_1648326773638.pdf
Let us getderanged (John Baez, 2003)_1648326773701.pdf
PPT (David Gerard, 2017) Proofs from Axioms of Probability_1648326773786.pdf
Euler, Mei-Ko Kwan, Konigsberg, and a Chinese Postman (Yuan 2012)_1648326773833.pdf
PhD Thesis1995 (David Pisinger; University of Copenhagen) Algorithms for Knapsack Problems_1648326773925.pdf
The Knapsack Problem (personal.utdallas.edu)_1648326774100.pdf
SIGCSE1991 Mathematics and Computer Science at Odds over Real Numbers_1648326774221.pdf
The Roles of Mathematics in Computer Science_1648326774354.pdf
ICER17 (Knobelsdorf) Theorem Provers as a Learning Tool in Theory of Computation_1648326774634.pdf