Theoretical Computer Science Stack Exchange

0 votes

1 answer

107 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

hulululu_Kaveman

1

modified 5 hours ago

2 votes

1 answer

180 views

Construct an orthogonal simple polygon from a set of N midpoints

CommunityBot

1

modified 14 hours ago

4 votes

1 answer

173 views

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

hulululu_Kaveman

1

answered 2 days ago

0 votes

1 answer

72 views

Bounded Resolution Property

Jan Johannsen

4,923

modified 2 days ago

0 votes

0 answers

47 views

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

user78871

1

asked 2 days ago

1 vote

0 answers

52 views

Intermediate problems in $Logspace$

Turbo

13.7k

modified 2 days ago

-2 votes

0 answers

70 views

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

Turbo

13.7k

modified 2 days ago

2 votes

0 answers

48 views

Full version of Grigory Kogan's paper

xoxo

21

asked 2 days ago

1 vote

1 answer

173 views

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

CommunityBot

1

modified Dec 4 at 5:04

1 vote

0 answers

277 views

+50

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

Turbo

13.7k

modified Dec 3 at 23:58

-3 votes

0 answers

44 views

why reduced costs in minimum arborescence problem?

Iman ghader

1

asked Dec 3 at 14:40

0 votes

1 answer

102 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

199 views

How to combine graded modality with simply typed lambda calculus?

taquetgauche

136

modified Dec 1 at 10:25

12 votes

1 answer

454 views

Extreme rays of the cone of submodular functions

Kristof

11

modified Dec 1 at 8:48

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

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

Full version of Grigory Kogan's paper

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

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

why reduced costs in minimum arborescence problem?

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

Hot Network Questions