Scribd Logo
Upload

Welcome to Scribd!

  • Space Complexity Recitation

    Uploaded by

    Kyogbsy
    6 views1 page
    This document provides an outline for a recitation on space complexity that includes four problems: 1) Analyzing problems from a fake homework assignment. 2) Showing that a language of properly nested parentheses is in class L. 3) Discussing whether a quantified Boolean formula is in class NP and possible certificates. 4) Discussing the complexity of various games like geography and checking if time allows proving geography is PSPACE-hard.

    Original Description:

    Discrete Event Systems

    Original Title

    bitstream_775562

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides an outline for a recitation on space complexity that includes four problems: 1) Analyzing problems from a fake homework assignment. 2) Showing that a language of properly nested parentheses is in class L. 3) Discussing whether a quantified Boolean formula is in class NP and possible certificates. 4) Discussing the complexity of various games like geography and checking if time allows proving geography is PSPACE-hard.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Space Complexity Recitation

    Uploaded by

    Kyogbsy
    This document provides an outline for a recitation on space complexity that includes four problems: 1) Analyzing problems from a fake homework assignment. 2) Showing that a language of properly nested parentheses is in class L. 3) Discussing whether a quantified Boolean formula is in class NP and possible certificates. 4) Discussing the complexity of various games like geography and checking if time allows proving geography is PSPACE-hard.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    6.045J/18.400J: Automata, Computability and Complexity Prof.

    Nancy Lynch

    Recitation 13: Space Complexity


    May 05, 2005

    Readings: Sections 8.2, 8.3

    Outline for Today:


    Problem 1: Let us look at the problems in Fake Homework 10.
    Problem 2: (Sipser 8.11) Let be the language of properly nested parentheses. For example, (()) and
    (()(()))() are in , but )( is not. Show that is in L.
    Problem 3: Suppose we are given a Quantified Boolean Formula of the form 
          
         .
    Why is this (possibly) not in "! ? What is the possible certificate that you can produce to prove that this
    QBF formula is true ?
    SAT formulae (of the kind we saw when we talked about ! and #! ) are special cases of QBFs. They
    are QBFs of the form $  $   %         .
    Problem 4: Games The formula game, Geography Game, Othello (Reversi), Checkers, . . . . If we get time,
    we will show that the Geography game is PSPACE-hard.

    13: Space Complexity-1

    You might also like