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

0

votes

0

answers

1

view

What's the asymptotically lower bound of time complexity that iterate all r combinations of an arraylist length n?

ds.algorithms time-complexity combinatorics

asked 1 min ago Voyager 101

7

votes

1

answer

34

views

What are the general direction and target question in the field of quantum error correction?

quantum-computing coding-theory complexity-theory fault-tolerance

modified 3 hours ago Root 415

3

votes

0

answers

56

views

NP complete problem help

cc.complexity-theory np-hardness complexity-classes cg.comp-geom

asked 8 hours ago Andres Fuentes 31

0

votes

0

answers

16

views

Internal as well as external partition of (regular) graphs

graph-theory

asked 10 hours ago Cyriac Antony 1,085

0

votes

1

answer

105

views

Lower bound of real valued bounded function

machine-learning lg.learning pac-learning

modified 16 hours ago Aryeh 8,779

3

votes

1

answer

112

views

(eps,delta)-approx with VC-Dimension 1?

cg.comp-geom lg.learning vc-dimension

answered 18 hours ago Matteo 579

1

vote

0

answers

29

views

Complexity class name for the class of languages that are $\Sigma^1_1$-definable over finite domains

cc.complexity-theory lo.logic terminology descriptive-complexity finite-model-theory

asked 18 hours ago Erfan Khaniki 262

3

votes

1

answer

123

views

Are all problems in the same time hierarchy related to each other?

time-complexity oracles time-hierarchy

modified 19 hours ago Community♦ 1

4

votes

1

answer

44

views

Context weakening as an explicit rule for languages of the the lambda cube?

type-theory calculus-of-constructions

answered 23 hours ago Andrej Bauer 24.8k

-3

votes

0

answers

30

views

A variant of the Generalized Assignment problem

cc.complexity-theory np-hardness np-complete matching bipartite-graphs

modified yesterday MarsPlus 137

-3

votes

0

answers

23

views

What changes the output on this black box?

black-box

asked yesterday Tyler M 95

1

vote

1

answer

72

views

Constructing Orbits of the Automorphism of a Graph Group in Bliss

graph-isomorphism software

modified yesterday Community♦ 1

8

votes

6

answers

3k

views

Importance of irrational numbers in computer science

computability

answered 2 days ago Nitin Verma 11

0

votes

0

answers

68

views

Optimal $\ell^1$ sketching, including the coefficient

randomized-algorithms embeddings

modified 2 days ago AmeerJ 595

Browse more Questions

Theoretical Computer Science Stack Exchange works best with JavaScript enabled