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 1 Bountied Hot Week Month

4

votes

1

answer

154

views

Why do TCS papers have author names in alphabetical order of their surnames?

soft-question

modified 10 hours ago Ilkka Törmä 236

-3

votes

0

answers

36

views

Complexity of finding largest non-vanishing minor?

counting-complexity linear-algebra matrices complexity tensor-rank

asked 15 hours ago T.... 10.9k

0

votes

0

answers

15

views

a direct polynomial reduction from 3EQU-SUM to EQU-SUM problem

reductions partition-problem subset-sum

asked 16 hours ago Fatemeh Ghasemi 1

1

vote

1

answer

62

views

Asymptotic Approximation to Number of Knapsack Solutions

counting-complexity asymptotics

modified yesterday Neal Young 5,507

25

votes

7

answers

3k

views

Why would a TCS researcher need funding?

soft-question career

answered yesterday Aryeh 8,148

-2

votes

0

answers

29

views

What are Abbreviated Tables/m-functions in Turing's 1936 paper?

turing-machines

asked yesterday Ajax 97

2

votes

1

answer

77

views

Online TCS Seminars

soft-question

answered yesterday Joshua Grochow 32.7k

3

votes

1

answer

85

views

What arithmetical theorems can plain $\lambda \Pi$ reason about?

type-theory proof-theory typed-lambda-calculus

answered yesterday cody 12.1k

38

votes

3

answers

2k

views

Is there a backup/replacement for the Complexity Zoo?

cc.complexity-theory reference-request soft-question

modified yesterday Emil Jeřábek 11.4k

1

vote

1

answer

41

views

Name of (and solution to) this generalization of linear assignment

co.combinatorics optimization integer-programming

answered yesterday D.W. 8,990

1

vote

0

answers

25

views

Given a program specification, S, what can be said about the size and efficiency of programs that exactly satsify S, with respect to the size of S?

computability turing-machines kolmogorov-complexity universal-turing-machines

asked yesterday user10108 11

5

votes

1

answer

196

views

Witness verifiable quantum advantage

cc.complexity-theory quantum-computing ce.computational-finance

modified yesterday Mark S 732

1

vote

1

answer

27

views

kmeans++ for arbitrary metric spaces and general potential function

approximation-algorithms randomized-algorithms clustering metric-spaces

answered yesterday Neal Young 5,507

Browse more Questions

Theoretical Computer Science Stack Exchange works best with JavaScript enabled