Professional Documents
Culture Documents
PSPACE: A Class of
Problems Beyond NP
1
Geography Game
Geography. Amy names capital city c of country she is in. Bob names a
capital city c' that starts with the letter on which c ends. Amy and
Bob repeat this game until one player is unable to continue. Does Alice
have a forced win?
2
9.1 PSPACE
PSPACE
Observation. P ⊆ PSPACE.
4
PSPACE
Theorem. NP ⊆ PSPACE.
Pf. Consider arbitrary problem Y in NP.
■ Since Y ≤P 3-SAT, there exists algorithm that solves Y in poly-time
plus polynomial number of calls to 3-SAT black box.
■ Can implement black box in poly-space. ▪
5
9.3 Quantified Satisfiability
Quantified Satisfiability
assume n is odd
Intuition. Amy picks truth value for x1, then Bob for x2, then Amy for
x3, and so on. Can Amy satisfy Φ no matter what Bob does?
Ex. ( 1 ∨ 2 ) ∧ ( 2 ∨ 3)€∧ ( 1 ∨ 2 ∨ 3)
Yes. Amy sets x1 true; Bob sets x2; Amy sets x3 to be same as x2.
€ Ex. ( 1 ∨ 2 )∧ ( 2 ∨ 3) ∧ (1∨ 2 ∨ 3)
∃
x1 = 0 x1 = 1 return true iff both
subproblems are true
∀ ∀
x2 = 1 return true iff either
x2 = 0 subproblem is true
∃ ∃ ∃ ∃
x3 = 0 x3 = 1
8
9.4 Planning Problem
15-Puzzle
1 2 3 1 2 3 ? 1 2 3
move 12
4 5 6 4 5 ... 4 5 6
8 7 8 7 6 7 8
10
Planning Problem
Examples.
■ 15-puzzle.
■ Rubik's cube.
■ Logistical operations to move people, equipment, and materials.
11
Planning Problem: 8-Puzzle
Operators. 1 2 3
Precondition to apply Oi = {C11, C22, …, C66, C78, C87, C99}.
■ 4 5 6
After invoking Oi, conditions C79 and C97 become true.
■
8 9 7
After invoking Oi, conditions C78 and C99 become false.
■
12
Diversion: Why is 8-Puzzle Unsolvable?
8-puzzle invariant. Any legal move preserves the parity of the number
of pairs of pieces in reverse order (inversions).
3 1 2 3 1 2 3 1 2
4 5 6 4 5 6 4 6
8 7 8 7 8 5 7
1 2 3 1 2 3
4 5 6 4 5 6
7 8 8 7
0 inversions 1 inversion: 7-8
13
Planning Problem: Binary Counter
■ After invoking Oi, conditions C1, …, Ci-1 become false. set i-1 least significant
bits to 0
14
Planning Problem: In Exponential Space
Configuration graph G.
■ Include node for each of 2n possible configurations.
■ Include an edge from configuration c' to configuration c'' if one of
the operators can convert from c' to c''.
Note. Configuration graph can have 2n nodes, and shortest path can
be of length = 2n - 1.
binary counter
15
Planning Problem: In Polynomial Space
16
9.5 PSPACE-Complete
PSPACE-Complete
18
PSPACE-Complete Problems
most k steps?
Do two regular expressions describe different languages?
■
processors?
19
Competitive Facility Location
10 1 5 15 5 1 5 1 15 10
20
Competitive Facility Location
Pf.
21
Competitive Facility Location
assume n is odd
10n 10n
xn xn
..
€
100
.€ 100
x2 x2
10 10
€ €
x1 x1
22
€ €
Competitive Facility Location
10n 10n
xn xn
1
..
x1 ∨ x2 ∨ xn €
100
.€ 100
x2 x2
€ 10 10
€ €
x1 x1
23
€ €