Skip to main content

Explore our questions

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

2 votes
1 answer
180 views

Construct an orthogonal simple polygon from a set of N midpoints

4 votes
1 answer
173 views

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

0 votes
1 answer
72 views

Bounded Resolution Property

0 votes
0 answers
47 views

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

1 vote
0 answers
52 views

Intermediate problems in $Logspace$

-2 votes
0 answers
70 views

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

2 votes
0 answers
48 views

Full version of Grigory Kogan's paper

1 vote
1 answer
173 views

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

1 vote
0 answers
277 views
+50

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

-3 votes
0 answers
44 views

why reduced costs in minimum arborescence problem?

0 votes
1 answer
102 views

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

4 votes
1 answer
199 views

How to combine graded modality with simply typed lambda calculus?

12 votes
1 answer
454 views

Extreme rays of the cone of submodular functions

Browse more Questions