- CSC438F/2404F Problem Set 1 Fall 2008 Due: Friday, September 26, in tutorial
- CSC2401F Problem Set 3 (Problems 1b, 2b Corrected) Fall, 2010 Due: Monday, Nov 22
- The Proof Complexity of Linear Algebra Michael Soltys and Stephen Cook
- Branching Programs: Avoiding Barriers
- The P versus NP Problem Stephen Cook
- CSC 2429S Notes (S. Cook) Spring, 2002 More Propositional Proof Complexity
- CSC 2401F Introduction to Computational Complexity Lectures: M 34 in WB130 and W 34 in BA1240
- 2429F Solutions to Problem Set 1 Fall 2007 1. O4, page 36: Show I# 0 proves
- CSC2401F Solutions to Problem Set 4 Fall, 2010 Due: Monday, Dec 20
- Formal Reasoning Using LowComplexity Concepts
- A second-order system for polytime reasoning based on Gradel's Stephen Cook and Antonina Kolokolova
- Pebbles and Branching Stephen Cook
- CSC2401F Problem Set 1 (Corrected) Fall, 2010 Due: Monday, Oct 4
- CSC 364S Notes University of Toronto, Spring, 2003 NP and NP-Completeness
- CSC 2429S Notes (S. Cook) Spring, 2002 V 1 and the Polytime Functions
- Bounded Reverse Mathematics
- The Complexity of Proving the Discrete Jordan Curve Theorem
- A Tight Relationship between Generic Oracles and Type2 Complexity Theory
- How to Associate Propositional Proof Systems
- Theories for Complexity Classes and their Propositional Translations
- The strength of replacement in weak arithmetic STEPHEN COOK and NEIL THAPEN
- CSC365S Problem Set 3 Winter, 2011 Due: Friday, March 11, beginning of tutorial
- Formal Reasoning Using LowComplexity Concepts
- The Relative Complexity of NP Search Problems Paul Beame 3
- To appear in Distributed Computing 15 (2002), c #SpringerVerlag
- Relativizing Small Complexity Classes and their Klaus Aehlig # Stephen Cook Phuong Nguyen
- Jan Kraj'icek , Pavel Pudl'ak , and Gaisi Takeuti. Bounded arithmetic and the polynomial time hierarchy. Annals of pure and applied logic, vol. 52 (1991), pp. 143153.
- CSC 364S Notes Spring, 2003 Turing Machines and Reductions
- CSC 2429S Notes (S. Cook) Spring, 2002 Propositional Translations of V 1 Theorems
- CSC2401F Solutions to Problem Set 3 Fall, 2010 Due: Monday, Nov 22
- CSC438F/2404F Problem Set 4 Fall 2008 Due: Friday, November 14, in tutorial
- Formal Reasoning Using LowComplexity Concepts
- Functional Interpretations of Feasibly Constructive Arithmetic 1
- 2429F Solutions to Problem Set 4 Fall 2007 1. Prove that every function in FP is # B
- A Complete Axiomatization for Blocks World Stephen A. Cook and Yongmei Liu
- A second-order system for polytime reasoning based on Gradel's theorem ?
- CSC 2429S Notes (S. Cook) Spring, 2002 The Propositional Calculus and System PK
- CSC2401F Solutions to Problem Set 2 Fall, 2010 Due: Monday, Oct 25
- #Copyright 2004, 2005, 2006, 2007, 2008 FOUNDATIONS OF
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Incompleteness and Undecidability
- Consequences of the Provability of NP # P/poly
- A Note on the Lengths of G 0 Stephen Cook
- DRAFT Chapter 9 Theories for Small Classes
- CSC438F/2404F Problem Set 3 Fall 2008 Due: Friday, October 31, in tutorial
- CSC 2429S: Proof Complexity and Bounded Stephen Cook
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- CSC365S Problem Set 1 Winter, 2011 Due: Friday, January 28, beginning of tutorial
- CSC 2429S Notes (S. Cook) Spring, 2002 Predicate Calculus and the System LK
- CSC 2429S Notes (S. Cook) Spring, 2002 Peano Arithmetic and its Subsystem I 0
- #Copyright 2004, 2005, 2006, 2007, 2008 FOUNDATIONS OF
- 0.1. THE THEORY VP 1 CSC 2429F Notes (S. Cook, P. Nguyen) Fall, 2007
- CSC438F/2404F Problem Set 5 Fall 2008 Due: Friday, December 5, in tutorial
- CSC 438F/2404F Computability and Logic Fall, 2008 Prerequisites for 438: See Calendar
- CSC365S Problem Set 4 Winter, 2011 Due: Friday, April 1, beginning of tutorial
- Capturing Complexity Classes by their Reasoning
- How to Associate Propositional Proof Systems
- CSC 365S Solutions to Midterm Test March 4, 2011 NO AIDS ALLOWED. Answer ALL questions on test paper. Use backs of sheets for scratch work.
- Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations
- CSC 2429S Notes (S. Cook) Spring, 2002 De ning y = 2 i and Bit(i; x) in I 0
- CSC 2429S Notes (S. Cook) Spring, 2002 Witnessing in V 0
- CSC2401F Problem Set 4 Fall, 2010 Due: Monday, Dec 20
- Branching Programs for Tree Evaluation Mark Braverman1
- Complexity Theory for Operators in Analysis Akitoshi Kawamura
- CSC 2429S Notes (S. Cook) Spring, 2002 The Second-Order System V 0
- The Importance of the P versus NP Question 1 Stephen Cook
- DRAFT Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations
- 2008 CRMFieldsPIMS Prize: Allan Borodin Stephen Cook
- CSC365S Solutions to Problem Set 3 Winter, 2011 Due: Friday, March 11, beginning of tutorial
- A secondorder theory for NL Stephen Cook and Antonina Kolokolova
- Efficiently Approximable RealValued Functions Valentine Kabanets Charles Rackoff Stephen A. Cook
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Recursive and Recursively Enumerable Sets
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Godel's Incompleteness Theorems
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Herbrand Theorem, Equality, and Compactness
- CSC 2429S Notes (S. Cook) Spring, 2002 Introduction to Propositional Proof Complexity
- CSC 2429S Notes (S. Cook) Spring, 2002 Corrected Statement and Proof of Parikh's Theorem
- Corrections for Logical Foundations of Proof Complexity
- A NEW RECURSION-THEORETIC CHARACTERIZATION OF THE
- JOURNAL OF ALGORITHMS 8,385-394 (1987) Problems Complete for Deterministic
- The Relative Efficiency of Propositional Proof Systems Author(s): Stephen A. Cook and Robert A. Reckhow
- JOURNAL OF COMPUTERAND SYSTEMSCIENCES 7, 354--375 (1973) Time Bounded Random AccessMachines
- CSC365S Problem Set 2 Winter, 2011 Due: Friday, February 18, beginning of tutorial
- Page 1 out of 12 University of Toronto
- Branching Programs for Tree Evaluation Mark Braverman 1 , Stephen Cook 2 , Pierre McKenzie 3 , Rahul Santhanam 4 , and
- Page 1 out of 11 University of Toronto
- CSC 2429S Notes (S. Cook) Spring, 2002 1 Introduction
- Boolean Programs and Quanti ed Propositional Proof Systems
- CSC 438F/2404F Notes Fall, 2008 The first two references have especially influenced these notes and are cited from time to
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- 2429F Solutions to Problem Set 3 Fall 2007 1. (This extends Exercise 5.12) In the proof of Lemma 5.10 (Any model M for I# 0 can
- CSC 364S Notes University of Toronto Spring, 2003 Computability and Noncomputability
- How to Associate Propositional Proof Systems
- Zambella's Model-Theoretic Proof of the Buss
- CSC438F/2404F Problem Set 2 Fall 2008 Due: Friday, October 10, in tutorial
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Completeness of System LK for Predicate Calculus
- CSC 2429S Notes (S. Cook) Spring, 2002 Linear Time Hierarchy and I 0
- CSC2401F Solutions to Problem Set 1 Fall, 2010 Due: Monday, Oct 4
- 2429F Solutions to Problem Set 2 Fall 2007 Acknowledgement: Thanks to the 2429 students whose solutions contributed ideas
- CSC2401F Problem Set 2 Fall, 2010 Due: Monday, Oct 25
- CSC365S Solutions to Problem Set 1 Winter, 2011 Due: Friday, January 28, beginning of tutorial
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Computability Theory
- DRAFT Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations
- CSC 2429S Notes (S. Cook) Spring, 2002 Equality Axioms, Compactness, Herbrand Theorem
- CSC 2429S Notes (S. Cook) Spring, 2002 Descriptive Complexity and AC 0
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- CSC365S Solutions to Problem Set 4 Winter, 2011 Due: Friday, April 1, beginning of tutorial
- An Exponential Lower Bound for the Size of Monotone Real Circuits
- CSC 438F/2404F Notes (S. Cook) Fall, 2008 Predicate Calculus
- Formal Reasoning Using LowComplexity Concepts
- SIAM J. COMPUT. Vol. 11, No. 2, May 1982
- CSC365S Solutions to Problem Set 2 Winter, 2011 Due: Friday, February 18, beginning of tutorial
- A Survey of Complexity Classes and their Associated
- A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem
- Proving Ultimate Limitations on Computers
- Formal Theories for Linear Algebra Stephen Cook and Lila Fontes
- Complexity Classes and Theories for the Comparator Circuit Value Problem
- CSC463F Problem Set 1 Fall, 2011 Due: Friday, September 30, beginning of tutorial
- CSC463F Solutions to Problem Set 1 Fall, 2011 Due: Friday, September 30, beginning of tutorial
- CSC463F Problem Set 4 Fall, 2011 Due: Friday, December 2, beginning of tutorial
- CSC463F Solutions to Problem Set 3 Fall, 2011 Due: Friday, Novermber 11, beginning of tutorial
- CSC463F Solutions to Problem Set 4 Fall, 2011 Due: Friday, December 2, beginning of tutorial
- CSC 463F Solutions to Midterm Test October 28, 2011 NO AIDS ALLOWED. Answer ALL questions on test paper. Use backs of sheets for scratch work.
- CSC463F Solutions to Problem Set 2 Fall, 2011 Due: Friday, October 21, beginning of tutorial
- CSC463F Problem Set 3 Fall, 2011 Due: Friday, Novermber 11, beginning of tutorial
- CSC463F Problem Set 2 Fall, 2011 Due: Friday, October 21, beginning of tutorial
- Page 1 out of 11 University of Toronto
