Question

Good book on (Quantum) Complexity and Computability Theories to start learning the theorem $MIP^* = RE$ as an operator algebraist

score 58 · Answer 1 · 2026-03-26 07:58:56

58

Views

Good book on (Quantum) Complexity and Computability Theories to start learning the theorem $MIP^* = RE$ as an operator algebraist

Published on 26 Mar 2026 - 7:58

score 64 · Answer 2 · 2023-12-17 10:02:46

64

Views

Logical Complexity of Ultrafilters

Published on 17 Dec 2023 - 10:02

score 83 · Answer 3 · 2023-12-24 18:18:30

83

Views

From a box of balls with 20 distinct colors, after drawing n balls with replacement, what is the probability of observing exactly x different colors?

Published on 24 Dec 2023 - 18:18

score 61 · Answer 4 · 2023-12-28 23:23:49

61

Views

Which grows faster?

Published on 28 Dec 2023 - 23:23

score 58 · Answer 5 · 2026-03-30 13:44:06

58

Views

Computing ${\rm Tr}(ABAB)$ with $B$ diagonal

Published on 30 Mar 2026 - 13:44

score 86 · Answer 6 · 2026-03-29 07:39:27

86

Views

Complexity of solving systems of linear inequalities with two variables per inequality with additional constraints

Published on 29 Mar 2026 - 7:39

score 15 · Answer 7 · 2026-03-05 00:40:34

15

Views

Time hierarchy theorem to show $Time(n^7)$ strictly contained in P

Published on 05 Mar 2026 - 0:40

score 61 · Answer 8 · 2024-01-15 03:20:27

61

Views

Karatsuba multiplication algorithm complexity

Published on 15 Jan 2024 - 3:20

score 74 · Answer 9 · 2024-01-15 09:40:06

74

Views

Why is computing powers in modular arithmetic $O(2^k)$?

Published on 15 Jan 2024 - 9:40

score 86 · Answer 10 · 2026-03-29 04:09:54

86

Views

Any relations between numbers representation in different bases?

Published on 29 Mar 2026 - 4:09

score 50 · Answer 11 · 2026-03-26 04:28:29

50

Views

Positive boolean satisfiability problem : finding minimal solutions.

Published on 26 Mar 2026 - 4:28

score 70 · Answer 12 · 2026-03-26 01:03:34

70

Views

Does the idea of creating a perfectly random problem to solve this have any merit, or is it completely useless quackery?

Published on 26 Mar 2026 - 1:03

score 77 · Answer 13 · 2026-03-26 12:41:09

77

Views

Fundamental Axiom of Floating Point Arithmetic for Complex Numbers Multiplication

Published on 26 Mar 2026 - 12:41

score 69 · Answer 14 · 2024-01-18 22:44:22

69

Views

What's wrong with this argument? Determining satisfiability of CNF

Published on 18 Jan 2024 - 22:44

score 136 · Answer 15 · 2026-03-29 11:51:43

136

Views

Polynomial Algorithm for checking if graph is Weisfeiler Leman isomorphism test counterexample

Published on 29 Mar 2026 - 11:51

List Question

Good book on (Quantum) Complexity and Computability Theories to start learning the theorem $MIP^* = RE$ as an operator algebraist

Logical Complexity of Ultrafilters

From a box of balls with 20 distinct colors, after drawing n balls with replacement, what is the probability of observing exactly x different colors?

Which grows faster?

Computing ${\rm Tr}(ABAB)$ with $B$ diagonal

Complexity of solving systems of linear inequalities with two variables per inequality with additional constraints

Time hierarchy theorem to show $Time(n^7)$ strictly contained in P

Karatsuba multiplication algorithm complexity

Why is computing powers in modular arithmetic $O(2^k)$?

Any relations between numbers representation in different bases?

Positive boolean satisfiability problem : finding minimal solutions.

Does the idea of creating a perfectly random problem to solve this have any merit, or is it completely useless quackery?

Fundamental Axiom of Floating Point Arithmetic for Complex Numbers Multiplication

What's wrong with this argument? Determining satisfiability of CNF

Polynomial Algorithm for checking if graph is Weisfeiler Leman isomorphism test counterexample

Trending Questions

Popular # Hahtags

Popular Questions