Theoretical Computer Science Stack Exchange

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

Neal Young

12.2k

modified 14 hours ago

1 vote

1 answer

84 views

Interpretation of P2C invariant in Paxos Made Simple?

CommunityBot

1

modified 15 hours ago

2 votes

1 answer

185 views

Construct an orthogonal simple polygon from a set of N midpoints

CommunityBot

1

modified yesterday

4 votes

1 answer

181 views

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

hulululu_Kaveman

13

answered 2 days ago

0 votes

1 answer

79 views

Bounded Resolution Property

Jan Johannsen

4,923

modified 2 days ago

0 votes

0 answers

50 views

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

user78871

1

asked 2 days ago

1 vote

0 answers

58 views

Intermediate problems in $Logspace$

Turbo

13.7k

modified Dec 5 at 0:42

-2 votes

0 answers

74 views

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

Turbo

13.7k

modified Dec 4 at 20:37

1 vote

1 answer

176 views

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

CommunityBot

1

modified Dec 4 at 5:04

1 vote

0 answers

279 views

+50

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

Turbo

13.7k

modified Dec 3 at 23:58

0 votes

1 answer

104 views

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

Naïm Camille Favier

501

answered Dec 1 at 16:00

4 votes

1 answer

200 views

How to combine graded modality with simply typed lambda calculus?

taquetgauche

136

modified Dec 1 at 10:25

12 votes

1 answer

457 views

Extreme rays of the cone of submodular functions

Kristof

11

modified Dec 1 at 8:48

12 votes

1 answer

277 views

How to succeed in remote TCS research as undergraduate

Joshua Grochow

39.4k

answered Dec 1 at 1:16

Stack Exchange Network

Explore our questions

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

Interpretation of P2C invariant in Paxos Made Simple?

Construct an orthogonal simple polygon from a set of N midpoints

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

Bounded Resolution Property

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

Intermediate problems in $Logspace$

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

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

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

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

How to combine graded modality with simply typed lambda calculus?

Extreme rays of the cone of submodular functions

How to succeed in remote TCS research as undergraduate

Hot Network Questions