Computer Science Stack Exchange

1 vote

2 answers

13 views

Find the largest possible number not larger than some integer N and is the product of K consecutive primes

algorithms time-complexity mathematical-programming binary-search primes

John L.

34k

modified 10 secs ago

0 votes

0 answers

2 views

Naïve array sampling algorithm: the possibility of a item being chosen and its time complexity

algorithms randomness statistics sampling

Stephen.W

101

modified 5 secs ago

1 vote

0 answers

20 views

Subgraph Isomorphism with Same Number of Nodes -- Homomorphism

complexity-theory graphs parameterized-complexity graph-isomorphism

Siolan

11

modified 1 hour ago

0 votes

0 answers

9 views

Building a BDD for a state space incremently

board-games bdd

Hendrik Jan

27.6k

asked 2 hours ago

0 votes

0 answers

8 views

What kinds of operations do modern GPU (Ampere architecture in particular) perform on FP or INT processing units?

computer-architecture

toothgoblin

1

asked 3 hours ago

0 votes

1 answer

25 views

DFA and NFA with 2 Substrings

regular-languages finite-automata regular-expressions

Nathaniel

7,077

answered 4 hours ago

1 vote

1 answer

86 views

Most scalable distributed consensus mechanism based on message complexity?

time-complexity performance consensus message-passing

CommunityBot

1

modified 6 hours ago

0 votes

0 answers

4 views

In tla+, how to verify termination in good state eventually as opposed to deadlock?

tlaplus

JackDaniels

101

asked 7 hours ago

0 votes

0 answers

7 views

How can I get the overall winner's leaf node in a loser tournament tree used for k-way merge?

algorithms binary-trees binary-search-trees balanced-search-trees mergesort

SpiritBob

113

asked 8 hours ago

3 votes

1 answer

43 views

Exotic closure of regular languages

regular-languages closure-properties

John L.

34k

modified 9 hours ago

1 vote

1 answer

111 views

Use the CFL pumping lemma to show that this language(0^p where p is prime) is not context free

automata pumping-lemma

CommunityBot

1

modified 11 hours ago

1 vote

0 answers

29 views

Efficient algorithm to count number of intersections of n sets

algorithms graphs optimization sets

snow

11

modified 12 hours ago

1 vote

1 answer

37 views

In IPv4, why is the number of host addresses available per network given by $2^\textrm{host bits} - 2$? This is in the context of classes

computer-networks

CommunityBot

1

modified 12 hours ago

2 votes

1 answer

131 views

Learning the activation function in a neural network?

neural-networks

CommunityBot

1

modified 14 hours ago

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our questions

Find the largest possible number not larger than some integer N and is the product of K consecutive primes

Naïve array sampling algorithm: the possibility of a item being chosen and its time complexity

Subgraph Isomorphism with Same Number of Nodes -- Homomorphism

Building a BDD for a state space incremently

What kinds of operations do modern GPU (Ampere architecture in particular) perform on FP or INT processing units?

DFA and NFA with 2 Substrings

Most scalable distributed consensus mechanism based on message complexity?

In tla+, how to verify termination in good state eventually as opposed to deadlock?

How can I get the overall winner's leaf node in a loser tournament tree used for k-way merge?

Exotic closure of regular languages

Use the CFL pumping lemma to show that this language(0^p where p is prime) is not context free

Efficient algorithm to count number of intersections of n sets

In IPv4, why is the number of host addresses available per network given by $2^\textrm{host bits} - 2$? This is in the context of classes

Learning the activation function in a neural network?

Hot Network Questions