Question

Is function evaluation by neural net faster then the analytical expression for the function itself?

score 93 · Answer 1 · 2026-04-11 08:35:46

93

Views

Is function evaluation by neural net faster then the analytical expression for the function itself?

Published on 11 Apr 2026 - 8:35

score 179 · Answer 2 · 2026-04-09 15:37:54

179

Views

How complicated is the theory of $2$?

Published on 09 Apr 2026 - 15:37

score 32 · Answer 3 · 2026-04-09 00:04:39

32

Views

The efficiency of finding a theorem of a first-order theory

Published on 09 Apr 2026 - 0:04

score 183 · Answer 4 · 2026-02-23 19:22:37

183

Views

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Published on 23 Feb 2026 - 19:22

score 735 · Answer 5 · 2026-04-09 20:14:54

735

Views

Computational complexity of 0-1 program

Published on 09 Apr 2026 - 20:14

score 136 · Answer 6 · 2020-08-23 16:27:16

136

Views

Find a function that respect these 3 conditions

Published on 23 Aug 2020 - 16:27

score 291 · Answer 7 · 2026-04-09 08:08:17

291

Views

Prove or disprove the following statement using the definition of big-Θ:

Published on 09 Apr 2026 - 8:08

score 130 · Answer 8 · 2026-04-02 22:11:35

130

Views

Is my proof that $\frac{n^3-3n^2+2n-17}{n^2-4n+22}=O(n)$ correct?

Published on 02 Apr 2026 - 22:11

score 801 · Answer 9 · 2026-04-11 07:34:14

801

Views

Bin Packing Problem with fixed size of bins

Published on 11 Apr 2026 - 7:34

score 195 · Answer 10 · 2026-04-11 14:23:25

195

Views

How to optimize the quadratic sieve setup arguments?

Published on 11 Apr 2026 - 14:23

score 80 · Answer 11 · 2026-04-11 11:52:17

80

Views

Efficient ways to calculate Lambert $W_{-1}(z)$ with an arbitrary precision.

Published on 11 Apr 2026 - 11:52

score 26 · Answer 12 · 2020-08-27 19:03:18

Which one is more expensive to compute: 1) $(A^TDA + \mu I)^{-1} x$, 2)$A^TDA y$, $A\in\mathbb{R}^{n\times m}$, diagonal $D\in\mathbb{R}^{n\times n}$

score 93 · Answer 13 · 2026-04-11 01:59:16

93

Views

What is the asymptotically fastest known exponentation algorithm?

Published on 11 Apr 2026 - 1:59

score 123 · Answer 14 · 2026-04-10 21:32:25

123

Views

Question about solving recurrence relation with constant in T(n) complexity

Published on 10 Apr 2026 - 21:32

score 96 · Answer 15 · 2026-03-25 22:30:49

96

Views

Proof of non-computability of subset of a countably infinite set

Published on 25 Mar 2026 - 22:30

List Question

Is function evaluation by neural net faster then the analytical expression for the function itself?

How complicated is the theory of $2$?

The efficiency of finding a theorem of a first-order theory

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Computational complexity of 0-1 program

Find a function that respect these 3 conditions

Prove or disprove the following statement using the definition of big-Θ:

Is my proof that $\frac{n^3-3n^2+2n-17}{n^2-4n+22}=O(n)$ correct?

Bin Packing Problem with fixed size of bins

How to optimize the quadratic sieve setup arguments?

Efficient ways to calculate Lambert $W_{-1}(z)$ with an arbitrary precision.

Which one is more expensive to compute: 1) $(A^TDA + \mu I)^{-1} x$, 2)$A^TDA y$, $A\in\mathbb{R}^{n\times m}$, diagonal $D\in\mathbb{R}^{n\times n}$

What is the asymptotically fastest known exponentation algorithm?

Question about solving recurrence relation with constant in T(n) complexity

Proof of non-computability of subset of a countably infinite set

Trending Questions

Popular # Hahtags

Popular Questions