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

Top Questions

Ask Question
Active Hot Week Month
8 votes
1 answer
332 views

What can we do with a generic oracle (as opposed to a random one)?

Emil Jeřábek's user avatar
Emil Jeřábek
  • 16.9k
4 votes
1 answer
355 views

Online TCS Seminars

Joshua Grochow's user avatar
Joshua Grochow
  • 36.9k
55 votes
7 answers
4k views

Good examples for how to write well in TCS

Ilk's user avatar
Ilk
  • 900
6 votes
2 answers
410 views

Error in Robson's proof about separating strings?

Hermann Gruber's user avatar
Hermann Gruber
  • 5,840
1 vote
0 answers
35 views

Find the SVM kernel in detecting if a substring in a given string

Tran Khanh's user avatar
Tran Khanh
  • 131
2 votes
0 answers
47 views

Is the Category of $(* \to)^n *$-kinded types freely generated from the discrete graph with $n$ nodes?

Johan Thiborg-Ericson's user avatar
Johan Thiborg-Ericson
  • 121
-1 votes
0 answers
26 views

corresponding resoving and arbitary resolving

Jxb's user avatar
Jxb
  • 315
5 votes
1 answer
137 views

Can CDCL Algorithm Derived Conflict Clauses Always Be Obtained Through Resolution from an Unsatisfiable CNF Formula?

holf's user avatar
holf
  • 2,164
0 votes
2 answers
58 views

Representing/Modelling fields and methods in the context of programming as automata

Community's user avatar
CommunityBot
  • 1
-1 votes
0 answers
75 views

Proof for Upper Bound on the Size of the Sum of Rational Numbers

Arcade_TryHard's user avatar
Arcade_TryHard
  • 1
0 votes
1 answer
98 views

Confusion about lower bounds and upper bounds in learning theory

Aryeh's user avatar
Aryeh
  • 10.3k
6 votes
3 answers
422 views

Finding a minimal context free grammar that recognizes a finite set of strings of bounded length

Hermann Gruber's user avatar
Hermann Gruber
  • 5,840
2 votes
0 answers
67 views

Enforcing general position in $2d$ linear programming

user3508551's user avatar
user3508551
  • 1,078
4 votes
0 answers
113 views

Convex optimization: is it possible to find solutions that are exactly feasible and approximately optimal in polynomial time?

Erel Segal-Halevi's user avatar
Erel Segal-Halevi
  • 2,086
0 votes
0 answers
40 views

Approximation ratio of randomized rounding for integral multi-commodity flow

Recursion's user avatar
Recursion
  • 1
0 votes
1 answer
47 views

How to calculate processor throughput boundary in CSAPP?

rigel's user avatar
rigel
  • 1
2 votes
0 answers
56 views

Many-one equivalence of sets that differ finitely

ijon's user avatar
ijon
  • 33
16 votes
2 answers
1k views

Is there a SETH (Strong Exponential Time Hypothesis) for CSP (Constraint Satisfaction Problem)?

Michael Lampis's user avatar
Michael Lampis
  • 3,416
-2 votes
1 answer
58 views

What is really the difference between membership queries and "querying in i.i.d?

Aryeh's user avatar
Aryeh
  • 10.3k
-2 votes
0 answers
45 views

d-regular graphs and edge expanders

math-nerd-in-cs's user avatar
math-nerd-in-cs
  • 1
0 votes
1 answer
57 views

Detecting Erroneous Corrections

Community's user avatar
CommunityBot
  • 1
-2 votes
0 answers
42 views

Greedy rounding technique

LyLa's user avatar
LyLa
  • 1
1 vote
1 answer
122 views

Are there any algorithms that the brain is better at solving than a regular computer? How would these be found/verified?

Command Master's user avatar
Command Master
  • 464
0 votes
0 answers
38 views

How the correctness of this construction can be proved? [closed]

likeAvirgin's user avatar
likeAvirgin
  • 1
0 votes
0 answers
92 views

Relationships between problem symmetry and its complexity

Ayoubayjx's user avatar
Ayoubayjx
  • 122
-1 votes
0 answers
63 views

What are you favorite techniques at finding lower bounds?

rivana's user avatar
rivana
  • 53
-1 votes
0 answers
23 views

Finding an algorithm EF[1,1] and PO division for more than two agents

S. M.'s user avatar
S. M.
  • 99
2 votes
2 answers
77 views

Learning with zero inductive bias

Aryeh's user avatar
Aryeh
  • 10.3k
1 vote
1 answer
237 views

The Complexity of Multi-Objective Optimization

Community's user avatar
CommunityBot
  • 1
1 vote
1 answer
97 views

Balanced set coloring

TheHolyJoker's user avatar
TheHolyJoker
  • 136
2 votes
2 answers
428 views

Technical limitations of Turing machines due to the input and output encoding of values

Gro-Tsen's user avatar
Gro-Tsen
  • 609
0 votes
1 answer
147 views

SAT to k-in-3-SAT reduction

Russell Easterly's user avatar
Russell Easterly
  • 549
3 votes
1 answer
133 views

Connection between strong normalization of the simply typed λ-calculus, and cut elimination for propositional logic

gadmm's user avatar
gadmm
  • 197
5 votes
1 answer
297 views

Problems complete for non-deterministic PSPACE

Hermann Gruber's user avatar
Hermann Gruber
  • 5,840
2 votes
1 answer
168 views

What’s the complexity of this decision problem with bit shifting?

D.W.'s user avatar
D.W.
  • 11.7k
3 votes
2 answers
251 views

Where should I apply for MS in CS if I want to get admitted for Phd in TCS

Vinicius dos Santos's user avatar
Vinicius dos Santos
  • 1,868
-1 votes
0 answers
49 views

Average case complexity of decision version of NP-hard problem

Subhra Mazumdar's user avatar
Subhra Mazumdar
  • 99
1 vote
0 answers
38 views

what are some Lower bound for finding large fourier coefficients of boolean function (above a threshold)?

rivana's user avatar
rivana
  • 53
1 vote
0 answers
63 views

Crafting ${NP}^{\#P}$-complete problems

Habri's user avatar
Habri
  • 11
0 votes
1 answer
56 views

Learning positive half-lines (in $\mathbb{N}$)

Aryeh's user avatar
Aryeh
  • 10.3k
2 votes
0 answers
42 views

Variable opening in locally-nameless representation

phdstudent's user avatar
phdstudent
  • 121
0 votes
0 answers
15 views

Any value in a formula that calculates (not look up) the 'order' of a 'Independent Edge Set' OR a 'I.E.S.' given an 'order' on complete graphs?

Tim's user avatar
Tim
  • 1
16 votes
0 answers
1k views

Are theoretical computer science conferences losing touch with reality?

kodlu's user avatar
kodlu
  • 2,070
1 vote
3 answers
89 views

Stable/Robust Traveling Salesman Approximation Methods

Neal Young's user avatar
Neal Young
  • 9,595
2 votes
0 answers
21 views

Hardness of 3-Partition with Small Target Value

John's user avatar
John
  • 173
1 vote
1 answer
78 views

Learning arithmetic series

Aryeh's user avatar
Aryeh
  • 10.3k
6 votes
0 answers
62 views

Updating (minimal) DFA incrementally

gsv's user avatar
gsv
  • 421
3 votes
1 answer
344 views

Intuition on Lupanov's Upper Bound on Circuit Size

Vladimir Lysikov's user avatar
Vladimir Lysikov
  • 632

Looking for more? Browse the complete list of questions, or popular tags. Help us answer unanswered 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.