Computer Science Stack Exchange

0

votes

0

answers

3

views

Clustering sets by set difference

optimization sets clustering

modified 3 mins ago taktoa 214

0

votes

1

answer

11

views

How to find the size of gaps between entries in an array so that the first and last element of the array is filled and the gaps are all of equal size?

arrays

answered 47 mins ago Steven 9,035

2

votes

1

answer

79

views

How to find how many times an object's path crosses another?

algorithms graphs

modified 1 hour ago Community♦ 1

-1

votes

0

answers

6

views

How to conceive a Turing machine that is the intersection of the languages of two Turing machines?

turing-machines

asked 1 hour ago WindBreeze 217

2

votes

1

answer

10

views

How to leverage the fact that I'm solving 1000's of very similar SMT instances?

optimization sat-solvers smt-solvers static-analysis

answered 3 hours ago D.W.♦ 122k

33

votes

5

answers

5k

views

Enumerate all non-isomorphic graphs of a certain size

algorithms graphs data-compression graph-isomorphism

answered 4 hours ago Leox 163

5

votes

4

answers

333

views

Is Group Theory useful in Computer Science in other areas but cryptography?

algorithms complexity-theory graphs data-structures group-theory

answered 4 hours ago Lawnmower Man 785

6

votes

7

answers

14k

views

Explaining why FFT is faster than DFT for the general public?

algorithms efficiency education didactics fourier-transform

answered 5 hours ago Yuval Filmus 228k

0

votes

0

answers

22

views

A reduction from $HP$ to $\{(\langle M \rangle, \langle k \rangle) : \text{M visits in at least $k$ states for any input}\}$

turing-machines reductions

modified 8 hours ago user5721565 209

1

vote

1

answer

33

views

Smallest Circuit for Square of Sparse Symmetric Matrix

complexity-theory circuits linear-algebra multiplication sparse-matrices

modified 8 hours ago Community♦ 1

0

votes

1

answer

33

views

How many different (full/complete) in-order binary-trees do exist?

binary-trees binary-search-trees

modified 9 hours ago Community♦ 1

0

votes

2

answers

11

views

Proof of Co-Problem being in NP if Problem is in NP using negated output

np-complete np decision-problem

answered 9 hours ago gnasher729 19k

1

vote

1

answer

25

views

Pumping Lemma for CFL - $ \{ 0^{i} 1^{j} 0^{k} 1^{l} \hspace{0.2cm}| \hspace{0.2cm} i = l \hspace{0.2cm} \land j = k \} $

context-free proof-techniques pumping-lemma correctness-proof

answered 9 hours ago user41805 193

0

votes

0

answers

15

views

Minimize shadows placing light sources on a diagram of a room

time-complexity optimization computational-geometry approximation applied-theory

asked 11 hours ago user2571861 1

Jun	JUL	Aug
	04
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Clustering sets by set difference

How to find the size of gaps between entries in an array so that the first and last element of the array is filled and the gaps are all of equal size?

How to find how many times an object's path crosses another?

How to conceive a Turing machine that is the intersection of the languages of two Turing machines?

How to leverage the fact that I'm solving 1000's of very similar SMT instances?

Enumerate all non-isomorphic graphs of a certain size

Is Group Theory useful in Computer Science in other areas but cryptography?

Explaining why FFT is faster than DFT for the general public?

A reduction from $HP$ to $\{(\langle M \rangle, \langle k \rangle) : \text{M visits in at least $k$ states for any input}\}$

Smallest Circuit for Square of Sparse Symmetric Matrix

How many different (full/complete) in-order binary-trees do exist?

Proof of Co-Problem being in NP if Problem is in NP using negated output

Pumping Lemma for CFL - $ \{ 0^{i} 1^{j} 0^{k} 1^{l} \hspace{0.2cm}| \hspace{0.2cm} i = l \hspace{0.2cm} \land j = k \} $

Minimize shadows placing light sources on a diagram of a room

Hot Network Questions