Theoretical Computer Science Stack Exchange

6

votes

3

answers

2k

views

Cubic graphs and hamiltonian paths

graph-theory co.combinatorics hamiltonian-paths

modified 3 hours ago Glorfindel 157

0

votes

0

answers

17

views

Bi-criteria combinatorial approximation algorithms for min k-vertex cover

approximation

modified 6 hours ago Television 104

1

vote

1

answer

52

views

Name for a special family of languages?

automata-theory

answered 6 hours ago Zed 26

63

votes

7

answers

3k

views

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

cc.complexity-theory lo.logic pl.programming-languages big-picture set-theory

modified 7 hours ago Timothy Chow 5,598

0

votes

0

answers

15

views

Is P-complete self-reducible?

cc.complexity-theory complexity-classes reductions p-hardness

asked 9 hours ago Frank Vega 22

0

votes

0

answers

6

views

No cyclical variable references within a for-loop = enough?

ds.algorithms pl.programming-languages turing-machines machine-models

modified 10 hours ago EnjoysMath 148

-1

votes

0

answers

80

views

Could we use transcendental numbers as an RNG?

randomness

modified 11 hours ago Apollys 104

5

votes

1

answer

89

views

Is F<: with bottom undecidable?

pl.programming-languages

modified 11 hours ago Jason Hu 171

0

votes

1

answer

63

views

Lower bound of real valued bounded function

machine-learning lg.learning pac-learning

modified 16 hours ago Aryeh 5,574

2

votes

0

answers

55

views

What are CS blogs for puzzles/games?

soft-question

modified 19 hours ago aaaa 28

-1

votes

0

answers

43

views

On derandomizing $BPP$ problem

derandomization polynomial-hierarchy

modified 20 hours ago Brout 4,865

-1

votes

0

answers

23

views

Counting class for DP problems

time-complexity sat counting-complexity

asked 21 hours ago Andrius Vaicenavicius 44

0

votes

1

answer

52

views

About learning a single Gaussian in total-variation distance

ds.algorithms machine-learning lg.learning st.statistics

modified yesterday Clement C. 2,111

-2

votes

0

answers

26

views

The maximum-weight subgraph problem, NP-hard? approximation?

np-hardness approximation

modified yesterday Tomlin 2

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Cubic graphs and hamiltonian paths

Bi-criteria combinatorial approximation algorithms for min k-vertex cover

Name for a special family of languages?

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

Is P-complete self-reducible?

No cyclical variable references within a for-loop = enough?

Could we use transcendental numbers as an RNG?

Is F<: with bottom undecidable?

Lower bound of real valued bounded function

What are CS blogs for puzzles/games?

On derandomizing $BPP$ problem

Counting class for DP problems

About learning a single Gaussian in total-variation distance

The maximum-weight subgraph problem, NP-hard? approximation?

Hot Network Questions