Question

Is it possible to prove that a problem $P$ is decidable in $O(\phi)$ without providing an algorithm that decides $P$ in $O(\phi)$?

score 152 · Answer 1 · 2012-03-20 02:36:50

152

Views

Is it possible to prove that a problem $P$ is decidable in $O(\phi)$ without providing an algorithm that decides $P$ in $O(\phi)$?

Published on 20 Mar 2012 - 2:36

score 773 · Answer 2 · 2026-03-27 10:46:11

773

Views

symmetric difference of languages - both are in NP and coNP

Published on 27 Mar 2026 - 10:46

score 104 · Answer 3 · 2012-03-30 08:06:21

104

Views

Complexity class P - is $k$ only natural numbers?

Published on 30 Mar 2012 - 8:06

score 8.9k · Answer 4 · 2012-04-07 00:27:55

8.9k

Views

Help proving that $(n+a)^b = \Theta(n^b)$

Published on 07 Apr 2012 - 0:27

score 900 · Answer 5 · 2012-04-10 09:22:39

900

Views

average distance in a graph

Published on 10 Apr 2012 - 9:22

score 5k · Answer 6 · 2026-03-30 00:18:30

5k

Views

Connecting all points on a plane with shortest path possible

Published on 30 Mar 2026 - 0:18

score 6.8k · Answer 7 · 2012-04-13 19:02:22

6.8k

Views

Is $2^{2n} = O(2^n)$?

Published on 13 Apr 2012 - 19:02

score 114 · Answer 8 · 2026-04-02 13:01:18

114

Views

$T(n) = n^{O(1)}$ iff exists $k > 0$ such that $T(n) = O(n^k)$

Published on 02 Apr 2026 - 13:01

score 130 · Answer 9 · 2026-04-02 12:55:52

130

Views

Finding the computational complexity of an algorithm

Published on 02 Apr 2026 - 12:55

score 1.6k · Answer 10 · 2026-03-30 17:49:02

1.6k

Views

Long integer multiplication using FFT in integer rings

Published on 30 Mar 2026 - 17:49

score 2.9k · Answer 11 · 2012-04-18 21:13:29

2.9k

Views

Divisor summatory function for squares

Published on 18 Apr 2012 - 21:13

score 749 · Answer 12 · 2012-04-19 11:55:09

749

Views

role of constant of proportionality in complexity of algorithm

Published on 19 Apr 2012 - 11:55

score 154 · Answer 13 · 2012-04-22 02:54:20

154

Views

Simplifying a logarithm of a little-o (circuit complexity)

Published on 22 Apr 2012 - 2:54

score 372 · Answer 14 · 2012-04-25 15:45:16

372

Views

A "State Hierarchy" Theorem for Turing Machines?

Published on 25 Apr 2012 - 15:45

score 1.6k · Answer 15 · 2012-05-05 17:57:08

1.6k

Views

What are the prerequisites in order to pursue the P vs. NP problem?

Published on 05 May 2012 - 17:57

List Question

Is it possible to prove that a problem $P$ is decidable in $O(\phi)$ without providing an algorithm that decides $P$ in $O(\phi)$?

symmetric difference of languages - both are in NP and coNP

Complexity class P - is $k$ only natural numbers?

Help proving that $(n+a)^b = \Theta(n^b)$

average distance in a graph

Connecting all points on a plane with shortest path possible

Is $2^{2n} = O(2^n)$?

$T(n) = n^{O(1)}$ iff exists $k > 0$ such that $T(n) = O(n^k)$

Finding the computational complexity of an algorithm

Long integer multiplication using FFT in integer rings

Divisor summatory function for squares

role of constant of proportionality in complexity of algorithm

Simplifying a logarithm of a little-o (circuit complexity)

A "State Hierarchy" Theorem for Turing Machines?

What are the prerequisites in order to pursue the P vs. NP problem?

Trending Questions

Popular # Hahtags

Popular Questions