Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. 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

3

votes

1

answer

74

views

What is the complexity of this weighted b-edge matching problem?

ds.algorithms graph-theory graph-algorithms np-hardness matching

modified yesterday JohnSnow123 33

7

votes

0

answers

107

views

Subgraph isomorphism on graph sequences

ds.algorithms reference-request graph-algorithms graph-isomorphism parameterized-complexity

modified Apr 2 at 9:22 LeechLattice 193

-2

votes

1

answer

40

views

Finding a non-negative solution to an integer system of linear equations

ds.algorithms linear-algebra matrices

answered Apr 2 at 5:40 D.W. 8,973

-1

votes

1

answer

76

views

Time complexity for multiplying two lower triangular matrices

cc.complexity-theory ds.algorithms time-complexity matrices recursion

answered Apr 1 at 15:36 Pranav Bisht 1

-3

votes

1

answer

820

views

Weighted matching algorithm for minimizing max weight

ds.algorithms graph-algorithms matching

modified Mar 31 at 20:30 omerbp 103

4

votes

0

answers

72

views

Optimal point placement on integer lattice

ds.algorithms optimization ds.data-structures computational-geometry voronoi

modified Mar 31 at 14:32 user56067 41

11

votes

5

answers

517

views

Submodular functions: reference request

ds.algorithms reference-request approximation-algorithms optimization

answered Mar 24 at 12:03 user56394 1

0

votes

0

answers

26

views

Best known bounds on feedback arcset in high-girth directed graphs?

ds.algorithms graph-theory directed-acyclic-graph combinatorics

asked Mar 24 at 3:55 Arun Jambulapati 1

-1

votes

0

answers

23

views

Evolving expression trees to approximate an unknown function

ds.algorithms approximation-algorithms randomized-algorithms tree ne.neural-evol

asked Mar 22 at 20:05 void 99

1

vote

1

answer

269

views

Potentially stronger form of non-$ETH$

ds.algorithms sat

modified Mar 22 at 14:29 narek Bojikian 231

45

votes

9

answers

7k

views

Best Upper Bounds on SAT

cc.complexity-theory ds.algorithms sat upper-bounds

modified Mar 20 at 20:16 Hermann Gruber 4,359

1

vote

1

answer

62

views

Running an algorithm for fixed amount of time on RAM model machine

ds.algorithms time-complexity machine-models formal-methods

answered Mar 14 at 4:37 D.W. 8,973

3

votes

2

answers

397

views

Optimization Problem on a Directed Graph

ds.algorithms graph-algorithms optimization

modified Mar 14 at 1:01 Community♦ 1

-2

votes

1

answer

159

views

Is it possible to sort by only knowing the sign of pairwise sums?

cc.complexity-theory ds.algorithms sorting

modified Mar 10 at 15:00 Community♦ 1

Browse more Questions

Theoretical Computer Science Stack Exchange works best with JavaScript enabled