Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active Hot Week Month

1

vote

1

answer

13

views

What is the “formula” for “any chipher can be deciphered by a quantum computer”?

complexity-theory time-complexity complexity-classes quantum-computing encryption

answered 2 hours ago Kyle Jones 7,125

1

vote

1

answer

27

views

Create binary numbers with a described pattern

algorithms time-complexity combinatorics binary bit-manipulation

modified 2 hours ago Ṃųỻịgǻňạcểơửṩ 236

1

vote

0

answers

13

views

Is there a concept of probabilistic quantum computers?

complexity-theory time-complexity quantum-computing probabilistic-algorithms

asked 12 hours ago porton 277

-2

votes

1

answer

21

views

recurrence relation for this n queen problem algorithm . and the time complexity

time-complexity algorithm-analysis backtracking

modified 13 hours ago Zero One 1

0

votes

2

answers

72

views

How is the NP verifier polynomial?

time-complexity nondeterminism

answered yesterday gnasher729 21.6k

2

votes

1

answer

3k

views

Building heaps and heapsort using linked list

algorithms algorithm-analysis data-structures time-complexity heaps

modified yesterday Community♦ 1

4

votes

2

answers

292

views

Polynomial-time linear-reduction from Directed Hamiltonian Path Problem to 3SAT

complexity-theory time-complexity np-complete reductions satisfiability

modified 2 days ago Andrew Johnson 11

1

vote

1

answer

59

views

Is $𝑂(𝑛^{1/2}) = \Omega(𝑛^{\sin(n)})$?

algorithms time-complexity asymptotics

answered Mar 1 at 20:22 Yuval Filmus 246k

-1

votes

2

answers

68

views

Does the O(n) algorithm always run faster than the O(n^3) algorithm? Why?

time-complexity

modified Feb 28 at 21:01 gnasher729 21.6k

6

votes

1

answer

5k

views

What is an optimal algorithm?

algorithms complexity-theory time-complexity lower-bounds

modified Feb 26 at 22:37 JohnLasheras2 1

1

vote

1

answer

50

views

Why do these functions satisfy that f(n) is not O(g(n)) and g(n) is not O(f(n))?

time-complexity

answered Feb 26 at 22:15 zkutch 1,421

0

votes

0

answers

44

views

How much faster are out machines (generally) than Arthur C. Clarke's machine in 1953's “The 9 Billion Names of God”?

algorithms time-complexity

asked Feb 26 at 21:33 h.and.h 101

0

votes

0

answers

24

views

Implement Immediate Smaller Element problem using Stack

time-complexity arrays stacks

modified Feb 26 at 16:19 salazarin 101

1

vote

1

answer

170

views

Is this clique algorithm in polynomial time correct or might it have another time complexity?

complexity-theory time-complexity polynomial-time clique

modified Feb 26 at 2:17 Steven 13.1k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled