Skip to main content

Explore our questions

1 vote
2 answers
143 views

Is path relation $P_n$, length of path n between x and y, definable by $P_3$ and $P_4$ in first order logic, with no edge relation

1 vote
1 answer
84 views

Interpretation of P2C invariant in Paxos Made Simple?

2 votes
1 answer
185 views

Construct an orthogonal simple polygon from a set of N midpoints

4 votes
1 answer
181 views

Is there a text that contains all 4 Büchi-Elgot-Trakhtenbrot-style theorems?

0 votes
1 answer
79 views

Bounded Resolution Property

0 votes
0 answers
50 views

Is a Pokemon-Battle NP-complete? Can I map it to SAT3?

1 vote
0 answers
58 views

Intermediate problems in $Logspace$

-2 votes
0 answers
74 views

Are there non-trivial bipartite graph classes having deterministic approximation algorithms

1 vote
1 answer
176 views

Simplest example of a "natural" complete problem for a TFNP class

1 vote
0 answers
279 views
+50

$\#NAE2SAT$ and $\oplus NAE2SAT$ complexity

0 votes
1 answer
104 views

Defining a minimal formal system r.e consistent sigma representable/sound that proves it's own consistency

4 votes
1 answer
200 views

How to combine graded modality with simply typed lambda calculus?

12 votes
1 answer
457 views

Extreme rays of the cone of submodular functions

12 votes
1 answer
277 views

How to succeed in remote TCS research as undergraduate

Browse more Questions