关于理论计算和算法的一些书文清单[FROM DOUBAN]

原帖地址:http://www.douban.com/group/topic/13373074/

小组组长貌似挺强~

2010-08-14 19:23:01 来自: foo([;\mathbf{P}=\mathbf{BPP};])

楼主想把每天闲逛时见到的东西记下来,故开此贴。

欢迎补充。

<-----看完下面这些我就回老家结婚----->

===书籍===

Computational Complexity: A Modern Approach
http://www.cs.princeton.edu/theory/complexity/

Algorithms
http://www.cs.berkeley.edu/~vazirani/algorithms.html

A Computational Introduction to Number Theory and Algebra
http://shoup.net/ntb/

Algorithmic Game Theory
http://theory.stanford.edu/~tim/

The Complexity of Boolean Functions
http://ls2-www.cs.uni-dortmund.de/monographs/bluebook/index.shtml.en

Expander Graphs and their applications
http://www.cs.huji.ac.il/~nati/PAPERS/expander_survey.pdf

Computational Complexity: A Conceptual Perspective
http://www.wisdom.weizmann.ac.il/~oded/cc-drafts.html

P, NP, and NP-Completeness: The Basics of Complexity Theory
http://www.wisdom.weizmann.ac.il/~oded/bc-drafts.html

Graph Theory
http://diestel-graph-theory.com/

===课程讲义===

Pseudorandomness
http://people.seas.harvard.edu/~salil/cs225/

Spectral Graph Theory and its Applications
http://www.cs.yale.edu/homes/spielman/sgta/

Analysis of Boolean Functions
http://www.cs.cmu.edu/~odonnell/boolean-analysis/

Essential Coding Theory
http://courses.csail.mit.edu/6.440/spring08/index.html

===综述===

On the Unique Games Conjecture
http://cs.nyu.edu/~khot/papers/UGCSurvey.pdf

Recent developments in explicit constructions of extractors
https://cslx.haifa.ac.il/~ronen/online_papers/survey.ps

Concentration Inequalities and Martingale Inequalities: A Survey
http://www.internetmathematics.org/volumes/3/1/ChungLu.pdf

Some Applications of Coding Theory in Computational Complexity
http://arxiv.org/abs/cs/0409044

Pairwise Independence and Derandomization
http://www.math.ias.edu/~avi/BOOKS/TCS003-1.ps

Pseudorandom Generators: A Primer
http://www.wisdom.weizmann.ac.il/~oded/prg-primer.html

Random walks on graphs: a survey
http://www.cs.elte.hu/~lovasz/erdos.pdf

Outline of Basic Representation Theory
http://research.microsoft.com/en-us/um/people/cohn/Papers/reptheory.pdf

Probabilistically checkable proofs
http://people.csail.mit.edu/madhu/papers/2009/pcpcacm.pdf

===视频===

P = NP Discussion at IBM Almaden Research Center
http://www.livestream.com/newintelligence/video?clipId=pla_c31fb902-cd4e-410e-ba00-c0ae59b3ba0a

Physics in the 21st Century: Toiling in Feynman's Shadow
http://www.youtube.com/watch?v=SczraSQE3MY

2010 Turing Lecture
http://awards.acm.org/citation.cfm?id=2612174&year=2010&amp;aw=140.

===网站===

Theoretical Computer Science Q&A
http://cstheory.stackexchange.com/

MathOverflow
http://mathoverflow.net/

Complexity Zoo
http://qwiki.stanford.edu/wiki/Complexity_Zoo

Electronic Colloquium on Computational Complexity
http://www.eccc.uni-trier.de/eccc/

===杂项===

Theory of Computing Blog Aggregator
http://feedworld.net/toc/

A compendium of NP optimization problems
http://www.csc.kth.se/~viggo/problemlist/

Complexity results for scheduling problems
http://www.mathematik.uni-osnabrueck.de/research/or/class/

Erik Demaine's List of Events
http://erikdemaine.org/events/

Theory of Computation: A Scientific Perspective
http://www.wisdom.weizmann.ac.il/~oded/toc-sp2.html

Student Support
http://williamstallings.com/StudentSupport.html

The Mathematical Atlas
http://www.math-atlas.org/

Open Problem Garden - Theoretical Computer Science
http://garden.irmacs.sfu.ca/?q=category/theoretical_computer_science

 

 

 

No Comments

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a comment