Space complexity 姚鹏晖 Email: pyao@nju.edu.cn 助教: 刘明谋 liu.mingmou@smail.nju.edu.cn 答疑时间: 周四 2pm-4pm, 计算机科学与技术楼 502 http://tcs.nju.edu.cn/wiki/index.php/Main_Page.

Slides:

Advertisements

Similar presentations

Are lower bounds hard to prove? Michal Koucký Institute of Mathematics, Prague.

Advertisements

Space complexity [AB 4]. 2 Input/Work/Output TM Output.

Lecture 23 Space Complexity of DTM. Space Space M (x) = # of cell that M visits on the work (storage) tapes during the computation on input x. If M is.

1 Introduction to Complexity Classes Joan Feigenbaum Jan 18, 2007.

Lecture 24 Time and Space of NTM. Time For a NDM M and an input x, Time M (x) = the minimum # of moves leading to accepting x if x ε L(M) = infinity if.

 期中测验时间：本周五上午 9 ： 40  教师 TA 答疑时间 : 周三晚上 6 ： 00—8 ： 30  地点：软件楼 315 房间，  教师 TA ：李弋老师  开卷考试.

1 Complexity of domain-independent planning José Luis Ambite.

CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.

Complexity 12-1 Complexity Andrei Bulatov Non-Deterministic Space.

Computability and Complexity 22-1 Computability and Complexity Andrei Bulatov Hierarchy Theorem.

Technology that Grows Your Event How Technology is Changing Event Marketing 科技如何改变会展营销 Gu Xuebin 顾学斌 Managing Director Info Salons China.

Linux 操作系统分析陈香兰（西区电三 421 ） Autumn 2007.

CS151 Complexity Theory Lecture 12 May 6, CS151 Lecture 122 Outline The Polynomial-Time Hierarachy (PH) Complete problems for classes in PH, PSPACE.

Hierarchy Theorems. Space Hierarchy Theorem.

Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Class NL.

安全操作系统中国科学技术大学计算机系陈香兰（ 0512 －）助教：裴建国 Autumn 2008.

CS151 Complexity Theory Lecture 2 April 3, Time and Space A motivating question: –Boolean formula with n nodes –evaluate using O(log n) space?

UML 对象设计与编程主讲 : 董兰芳副教授 Dept. of Computer Science,USTC

Umans Complexity Theory Lectures Lecture 2c: EXP Complete Problem: Padding and succinctness.

中国科学技术大学视觉计算与可视化实验室讨论题目 _ 时间讨论题目演讲人： ** 指导教师： ** 老师中国科学技术大学计算机学院 2005 年 6 月 28 日.

CS151 Complexity Theory Lecture 2 April 1, CS151 Lecture 22 Time and Space A motivating question: –Boolean formula with n nodes –evaluate using.

English for Computer Science Lecture 1. Introduction  Course Introduction  What this Course Teaches  What this Course Does not Teach  What.

Discrete Mathematics I 暨南大学信息科学技术学院计算机科学系黄战副教授离散数学 I （全英）

机器学习陈昱北京大学计算机科学技术研究所信息安全工程研究中心. Concept Learning Reference : Ch2 in Mitchell’s book 1. Concepts: Inductive learning hypothesis General-to-specific.

CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.

Combinatorial Geometry 邓俊辉清华大学计算机系 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一 2015年10月12日星期一.

Z Electronic Commerce ;. What’s e-commerce? The use of computers and electronic communications in business transactions. E- commerce may include the use.

Analytical History & Evolutionary Economics 2005 Spring (2 Credits) Prof. Chen Ping China Center for Economic Research, Peking University

Theory of Computing Lecture 21 MAS 714 Hartmut Klauck.

B Let’s learn. Let’s play. 授课人：吴燕下周今天上午今天下午今天晚上今晚明天 next week this morning this afternoon this evening tonight tomorrow Phrases.

Manifold Learning on Probabilistic Graphical Models 概率图上的流形学习答辩人 : 邵元龙导师 : 鲍虎军教授 & 何晓飞教授浙江大学 CAD&CG 国家重点实验室 2010 年 3 月 5 日.

Computability NP complete problems. Space complexity. Homework: [Post proposal]. Find PSPACE- Complete problems. Work on presentations.

课程简介算法设计与分析 ( Design and Analysis of Algorithms) 任课教师 : 王轶彤 Tel: TA: 周泽学授课方式 : 全英文教学, 3.

Umans Complexity Theory Lectures Lecture 1c: Robust Time & Space Classes.

Foundations of Computer Science. Who am I? Wu Xinxiao ( 吴心筱 )

Fall 2013 CMU CS Computational Complexity Lecture 2 Diagonalization, 9/12/2013.

特邀学术报告报告题目： Integration of Wind Energy and Distributed Generation Resources in the US 报告人：报告人： Dr. John N. Jiang University of Oklahoma Norman, OK,

CSE 421 Algorithms Richard Anderson Lecture 29 Complexity Theory NP-Complete P.

Chapter 7 Introduction to Computational Complexity.

邹权 (PH.D.&Professor) 天津大学计算机科学与技术学院

Lecture 1-2 Time and Space of DTM

Research Institute for Future Media Computing

Google China Faculty Summit

The Graph Structure of RDF Sentences

Lecture 24 NP-Complete Problems

Umans Complexity Theory Lectures

Research Institute for Future Media Computing

Semantic Publishing Technology and Application

刘振上海交通大学计算机科学与工程系电信群楼3-509

Theory of Computability

Space Complexity Costas Busch - LSU.

Richard Anderson Lecture 29 Complexity Theory

Part II Theory of Nondeterministic Computation

刘振上海交通大学计算机科学与工程系电信群楼3-509

Research Institute for Future Media Computing

CS21 Decidability and Tractability

Umans Complexity Theory Lectures

Research Institute for Future Media Computing

Research Institute for Future Media Computing

Randomized computation

NP and NP completeness 姚鹏晖

英国伯明翰大学 Zhibing Zhang教授学术报告

An Introduction to Quantum Computation

第八届全国复杂网络学术会议 Spectra of transition matrix for networks: Computation and applications 章忠志复旦大学计算机科学技术学院 Homepage:

CS151 Complexity Theory Lecture 4 April 12, 2019.

LECTURE 2-9 PSPACE-Complete

瞿裕忠（Yuzhong Qu）计算机科学与技术系

Intro to Theory of Computation

Lecture 1-2 Time and Space of DTM

CS151 Complexity Theory Lecture 4 April 8, 2004.

Presentation transcript:

Space complexity 姚鹏晖 Email: pyao@nju.edu.cn 助教: 刘明谋 liu.mingmou@smail.nju.edu.cn 答疑时间: 周四 2pm-4pm, 计算机科学与技术楼 502 http://tcs.nju.edu.cn/wiki/index.php/Main_Page

What we have learnt The complexity classes P, NP,Co-NP, EXP, NEXP Reductions, NP-hard problems, NP-complete problems Diagonalization

Space-bounded computation

Space-constructible functions

Time complexity vs space complexity

Configuration graph

Time complexity vs space complexity

Space complexity classes

Space Hierarchy Theorem

PSPACE Completeness

PSPACE Completeness

PSPACE Completeness

PSPACE Completeness

Savitch’s theorem