2022 Developer Survey is open! Take survey.

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
Theoretical Computer Science

Explore our Questions

Ask Question
more tags
Active 1 Bountied Hot Week Month
0 votes
0 answers
5 views

"Operations" in category theory that are not defined for arrows

user avatar
PaR
  • 1
1 vote
0 answers
18 views

Question about algorithm for enumerating minimal AB-separators

user avatar
BBK
  • 33
0 votes
0 answers
20 views

Can we describe any context-sensitive language by a grammar without left recursion?

user avatar
guthondr
  • 1
1 vote
0 answers
56 views

Are there more learnable but undecidable cases except the halting problem

user avatar
Mountain
  • 111
5 votes
0 answers
39 views

Relationship between natural deduction refutation and tableaux for propositional logic

user avatar
gigabytes
  • 1,112
4 votes
1 answer
348 views

Space complexity of integer programming

user avatar
Turbo
  • 12.5k
0 votes
0 answers
40 views

The Complexity of Multi-Objective Optimization

user avatar
Refrain
  • 57
1 vote
0 answers
33 views

Is there an FPT or XP algorithm known for this version of $k$-edge disjoint paths problem?

user avatar
advocateofnone
  • 139
0 votes
0 answers
30 views

If two functions are close apart can I prove the difference of their empirical loss is also small?

user avatar
Silverstalon
  • 113
0 votes
0 answers
14 views

Determine number of possible formal languages with a nerode-index of k (k number of equivalence classes)

user avatar
Lorem ipsum
  • 101
0 votes
0 answers
46 views
+50

Direct fpt reduction from Weighted 3SAT to Weighted 2SAT

user avatar
Noel Arteche
  • 419
0 votes
0 answers
36 views

Solving sampling problems with circuits?

user avatar
trillianhaze
  • 21
3 votes
0 answers
55 views

Is there a standard way to "point" at subterms in a lambda expression?

user avatar
azani
  • 133
-1 votes
0 answers
52 views

How to prove a problem does not have an approximation algorithm?

user avatar
Shaan
  • 1
Browse more Questions

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.