Computer Science Stack Exchange

4 votes

1 answer

138 views

Simultaneous reachability of NFA states

CommunityBot

1

modified 2 days ago

4 votes

1 answer

143 views

Survival algorithm for Network deterministic failures

CommunityBot

1

modified Dec 2 at 9:04

1 vote

1 answer

134 views

Sorting O(log n) elements in O(n) time

Henrik supports the community

105

modified Nov 30 at 7:51

1 vote

1 answer

45 views

Time complexity of algorithm with three loops and if statement

SilvioM

605

modified Nov 30 at 7:47

1 vote

0 answers

37 views

How do i make a 2d array as same as i possibly can with another one?

Newbekitty

5

modified Nov 30 at 7:39

0 votes

1 answer

999 views

Finding all unique paths from a source to a sink in a specially-formed DAG

CommunityBot

1

modified Nov 29 at 0:02

0 votes

0 answers

54 views

Necklace Alignment Problem

Fireond

1

modified Nov 28 at 11:48

0 votes

1 answer

26 views

What is the largest "allowed" seed for a PRNG to not give any extra power to a deterministic machine?

D.W.♦

156k

answered Nov 28 at 5:39

0 votes

1 answer

1k views

Determine if an NFA accepts infinite language in polynomial time

CommunityBot

1

modified Nov 27 at 12:02

0 votes

1 answer

29 views

What's the Time Complexity and total no of iterations?

Naveed Ali

1

modified Nov 27 at 12:00

2 votes

1 answer

35 views

Time complexity of an uneven binary search

CommunityBot

1

modified Nov 26 at 6:00

1 vote

1 answer

129 views

Most scalable distributed consensus mechanism based on message complexity?

CommunityBot

1

modified Nov 23 at 21:03

0 votes

1 answer

23 views

$NL$ Leaf languages and $PSPACE$

Steven

28.3k

modified Nov 23 at 16:07

0 votes

1 answer

19 views

Why is $DSPACE(\log^2n)\subseteq DTIME(n^{\log n})$?

D.W.♦

156k

answered Nov 23 at 0:11

Stack Exchange Network

Explore our questions

Simultaneous reachability of NFA states

Survival algorithm for Network deterministic failures

Sorting O(log n) elements in O(n) time

Time complexity of algorithm with three loops and if statement

How do i make a 2d array as same as i possibly can with another one?

Finding all unique paths from a source to a sink in a specially-formed DAG

Necklace Alignment Problem

What is the largest "allowed" seed for a PRNG to not give any extra power to a deterministic machine?

Determine if an NFA accepts infinite language in polynomial time

What's the Time Complexity and total no of iterations?

Time complexity of an uneven binary search

Most scalable distributed consensus mechanism based on message complexity?

$NL$ Leaf languages and $PSPACE$

Why is $DSPACE(\log^2n)\subseteq DTIME(n^{\log n})$?

Hot Network Questions