Probalistically Checkable Proofs and approximation hardness (continued)
- Speaker(s)
- Anna Niewiarowska
- Affiliation
- Uniwersytet Warszawski
- Date
- May 23, 2007, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
You are not logged in |
Log in
|
