Question

solving 3_sat using system of polynomial equations in gf2

score 24 · Answer 1 · 2026-03-26 14:20:33

24

Views

solving 3_sat using system of polynomial equations in gf2

Published on 26 Mar 2026 - 14:20

score 40 · Answer 2 · 2024-02-22 22:20:01

40

Views

Efficiently calculating the inverse of a matrix $A+D$, where $A^{-1}$ is known and D is diagonal with few non-zero points

Published on 22 Feb 2024 - 22:20

score 33 · Answer 3 · 2024-02-26 03:47:49

33

Views

Proof that checking if a graph has a Hamiltonian cycle is NP-complete

Published on 26 Feb 2024 - 3:47

score 43 · Answer 4 · 2024-02-27 02:11:37

43

Views

Complexity of entailment between equivalences of dual formulas

Published on 27 Feb 2024 - 2:11

score 69 · Answer 5 · 2024-03-02 12:05:57

69

Views

$T(n)=T(n/3)+T(2n/3)+Θ(n)$, find a tight lower bound by substition

Published on 02 Mar 2024 - 12:05

score 2.9k · Answer 6 · 2024-03-06 04:11:38

2.9k

Views

Can any characterized property give a solid account of why multiplication is a harder computation operation than addition?

Published on 06 Mar 2024 - 4:11

score 17 · Answer 7 · 2024-03-07 09:38:11

17

Views

A question about computation analysis

Published on 07 Mar 2024 - 9:38

score 44 · Answer 8 · 2026-03-26 15:16:49

44

Views

Are sequenceable groups self-reducible?

Published on 26 Mar 2026 - 15:16

score 19 · Answer 9 · 2026-02-23 10:17:36

19

Views

Guess the number in the box - which complexity class does this belong in?

Published on 23 Feb 2026 - 10:17

score 20 · Answer 10 · 2026-03-25 12:52:07

20

Views

Is the Asymptotic complexity of the find max algorithm O(n) or O(n^2)?

Published on 25 Mar 2026 - 12:52

score 80 · Answer 11 · 2024-03-15 02:47:51

80

Views

How to solve a recurrence relation with full history $ T(n) = n + \sum_{i=1}^{n-1} \frac{2T(i)}{3i}$?

Published on 15 Mar 2024 - 2:47

score 22 · Answer 12 · 2024-03-15 03:02:43

22

Views

Big O notation from a for loop

Published on 15 Mar 2024 - 3:02

score 29 · Answer 13 · 2024-03-15 14:14:02

29

Views

How to find asymptotic bound for $ T(n) = n + \sum_{i=1}^{\lceil \log_3 n \rceil} T(\lfloor \frac {n}{3^i} \rfloor), n\ge 1 $?

Published on 15 Mar 2024 - 14:14

score 31 · Answer 14 · 2024-03-18 14:28:22

31

Views

Given a set of 2D vectors, determine whether a subset of them sums to a vector with two "large" coordinates

Published on 18 Mar 2024 - 14:28

score 73 · Answer 15 · 2026-03-27 10:07:10

73

Views

computational complexity of stabilization problem in Boolean control network

Published on 27 Mar 2026 - 10:07

List Question

solving 3_sat using system of polynomial equations in gf2

Efficiently calculating the inverse of a matrix $A+D$, where $A^{-1}$ is known and D is diagonal with few non-zero points

Proof that checking if a graph has a Hamiltonian cycle is NP-complete

Complexity of entailment between equivalences of dual formulas

$T(n)=T(n/3)+T(2n/3)+Θ(n)$, find a tight lower bound by substition

Can any characterized property give a solid account of why multiplication is a harder computation operation than addition?

A question about computation analysis

Are sequenceable groups self-reducible?

Guess the number in the box - which complexity class does this belong in?

Is the Asymptotic complexity of the find max algorithm O(n) or O(n^2)?

How to solve a recurrence relation with full history $ T(n) = n + \sum_{i=1}^{n-1} \frac{2T(i)}{3i}$?

Big O notation from a for loop

How to find asymptotic bound for $ T(n) = n + \sum_{i=1}^{\lceil \log_3 n \rceil} T(\lfloor \frac {n}{3^i} \rfloor), n\ge 1 $?

Given a set of 2D vectors, determine whether a subset of them sums to a vector with two "large" coordinates

computational complexity of stabilization problem in Boolean control network

Trending Questions

Popular # Hahtags

Popular Questions