** Circuit Lower Bounds for Merlin-Arthur Classes - Rahul Santhanam[#c26795e9]

[[Complexity Zoo:http://qwiki.stanford.edu/wiki/Complexity_Zoo]]: 計算クラスの定義まとめ

Domain: 連結開集合(切れ目がなく,縁を含まない)

Integral domain: 整域(ab = 0 のとき a = 0 か b = 0 に決まっているような集合)

** Trading Group Theory for Randomness - Laszlo Babai [#c0ef2f12]


** Theory of Computation - Thomas Zeugmann [#x642e472]

*** Part 1: Formal Languages [#y98e3622]

Front page   New List of pages Search Recent changes   Help   RSS of recent changes