Search results
Jump to navigation
Jump to search
- [[Category:Formatting Templates]] [[Category:Complexity Zoo Templates]]2 KB (258 words) - 03:10, 18 November 2012
- [[Category:Complexity Zoo Templates]] Warns that a page in the [[Complexity Zoo]] is a stub.723 bytes (84 words) - 03:10, 18 November 2012
- [[Category:Complexity Zoo Templates]] [[Category:Formatting Templates]]779 bytes (93 words) - 03:10, 18 November 2012
- [[Category:Complexity Zoo Templates]] [[Category:Formatting Templates]]1 KB (148 words) - 03:10, 18 November 2012
- Adds a page to categories appropriate for the [[Complexity Zoo]]. [[Category:Categorization Templates]]276 bytes (27 words) - 03:10, 18 November 2012
- [[Category:Shortcut Templates]] [[Category:Complexity Zoo Templates]]710 bytes (82 words) - 03:10, 18 November 2012
- [[Category:Complexity Zoo Templates]] [[Category:Shortcut Templates]]1,023 bytes (141 words) - 03:10, 18 November 2012
- [[Category:Complexity Zoo Templates]] [[Category:Formatting Templates]]971 bytes (110 words) - 03:10, 18 November 2012
- ...color:red">C<sub>=</sub>AC<sup>0</sup></span>: Exact-Counting [[Complexity Zoo:A#ac0|AC<sup>0</sup>]] ===== The class of problems for which there exists a [[Complexity Zoo:D#diffac0|DiffAC<sup>0</sup>]] function f such that the answer is "yes" on21 KB (3,514 words) - 17:35, 7 November 2022
- ...wer to the problem is "yes." Arthur must verify the proof in [[Complexity Zoo:B#bpp|BPP]] (i.e. probabilistic polynomial-time), so that Contains [[Complexity Zoo:N#np|NP]] and [[Complexity Zoo:B#bpp|BPP]]24 KB (4,051 words) - 05:55, 21 December 2023