List questions from computational-complexity

Published on 27 Mar 2026 - 20:13

1.1k

Views

Solving $Ax = b$ for non-negative $x$ given boolean matrix $A$ and non-negative $b$

Published on 28 Mar 2026 - 7:43

94

Views

Are mathematicians discovering algorithms by mining them with computers?

Published on 25 Mar 2026 - 8:12

75

Views

Is Math PSPACE Hard, since we have counterexamples of the belief of efficient proof verification?

Published on 08 Oct 2016 - 22:57

79

Views

Algorithm about nodes in graph

Published on 26 Mar 2026 - 6:26

21

Views

Recurrency equation, algorithms, complexity

Published on 13 Oct 2016 - 13:29

166

Views

What are the propositions or axioms in time complexity analysis that address the issue of practical machines versus theoretical machines?

Published on 26 Mar 2026 - 16:56

49

Views

number of additions of multiplication in computing efficiently

Published on 28 Mar 2026 - 12:14

83

Views

Big-O complexity proof

Published on 17 Oct 2016 - 3:18

244

Views

Can an $n \times n$ matrix multiply by a $1 \times n$ vector in less than $n^2$?

Published on 17 Oct 2016 - 12:54

204

Views

Have two questions regarding Godel numbering about natural numbers.

Published on 29 Mar 2026 - 12:41

1.9k

Views

What is the Big-O time complexity of n to the power n

Published on 18 Oct 2016 - 17:18

106

Views

Doubly exponential complexity of Presburger arithmetics

Published on 31 Mar 2026 - 21:33

1.6k

Views

Time complexity - Doubling the speed of a machine that uses a O(N Log N) algorithm

Published on 21 Oct 2016 - 12:04

1k

Views

BFS using Adjacency Matrix

Published on 21 Oct 2016 - 18:45

List Question

How does partition function $p(n)/n!$ grow (big-O, etc)?

Solving $Ax = b$ for non-negative $x$ given boolean matrix $A$ and non-negative $b$

Are mathematicians discovering algorithms by mining them with computers?

Is Math PSPACE Hard, since we have counterexamples of the belief of efficient proof verification?

Algorithm about nodes in graph

Recurrency equation, algorithms, complexity

What are the propositions or axioms in time complexity analysis that address the issue of practical machines versus theoretical machines?

number of additions of multiplication in computing efficiently

Big-O complexity proof

Can an $n \times n$ matrix multiply by a $1 \times n$ vector in less than $n^2$?

Have two questions regarding Godel numbering about natural numbers.

What is the Big-O time complexity of n to the power n

Doubly exponential complexity of Presburger arithmetics

Time complexity - Doubling the speed of a machine that uses a O(N Log N) algorithm

BFS using Adjacency Matrix

Trending Questions

Popular # Hahtags

Popular Questions