Theoretical Computer Science Stack Exchange

Score of -3

0 answers

89 views

Can the contrast between 2‑SAT and 3‑SAT in linear logic be turned into a proof of P ≠ NP?

Alain Kanyama

reputation score 1

asked 2 days ago

Score of 0

0 answers

89 views

Is my algorithm FPT if parameters grow with $n$?

J. Schmidt

reputation score 285

asked Jun 28 at 0:12

Score of 3

1 answer

111 views

Normalization by evaluation for system T

Andrej Bauer

reputation score 30182

modified Jun 26 at 8:37

Score of 7

2 answers

815 views

Does there exist a predictor that eventually predicts every computable binary sequence?

Denis

reputation score 9729

modified Jun 25 at 23:27

Score of 0

0 answers

63 views

how to show that the number of arranging tiles is #P-complete

user1720967

reputation score 1

asked Jun 25 at 10:33

Score of 2

2 answers

292 views

Show that the first agent weakly prefers their own bundle to anybody else's

CommunityBot

reputation score 1

modified Jun 19 at 21:07

Score of 8

1 answer

238 views

Partial word completions with a factor compatible with another partial word

Antoine Amarilli 'a3nm'

reputation score 11557

modified Jun 16 at 14:09

Score of 24

3 answers

1775 views

Decidability of diophantine equations over {=, +, gcd}

Emil Jeřábek

reputation score 21356

modified Jun 15 at 7:54

Score of 5

1 answer

112 views

Non-emptiness problem for Two-Way Alternating Parity Tree Automaton modulo a certain safety condition

Yendreque

reputation score 26

answered Jun 14 at 21:31

Score of 1

0 answers

72 views

A confusion in a proof of shrinkage exponent of de Morgan formulae of Hastad

minh quý lê

reputation score 161

asked Jun 14 at 15:43

Score of -1

1 answer

148 views

Computability Theory analogy of PSPACE

Noah Schweber

reputation score 668

answered Jun 14 at 1:51

Score of 6

1 answer

303 views

Is this problem in P? Given a bipartite graph, find a minimum cardinality set of edges which intersect every vertex cover

Mikhail Rudoy

reputation score 2963

answered Jun 13 at 11:06

Score of 1

0 answers

24 views

What rule features form persistent hierarchical structures in cellular automata?

Lance Pollard

reputation score 151

asked Jun 13 at 8:30

Score of 9

1 answer

575 views

Decidable fragment of second-order logic

Reijo Jaakkola

reputation score 1426

modified Jun 11 at 3:42

Stack Exchange Network

Explore our questions

Can the contrast between 2‑SAT and 3‑SAT in linear logic be turned into a proof of P ≠ NP?

Is my algorithm FPT if parameters grow with $n$?

Normalization by evaluation for system T

Does there exist a predictor that eventually predicts every computable binary sequence?

how to show that the number of arranging tiles is #P-complete

Show that the first agent weakly prefers their own bundle to anybody else's

Partial word completions with a factor compatible with another partial word

Decidability of diophantine equations over {=, +, gcd}

Non-emptiness problem for Two-Way Alternating Parity Tree Automaton modulo a certain safety condition

A confusion in a proof of shrinkage exponent of de Morgan formulae of Hastad

Computability Theory analogy of PSPACE

Is this problem in P? Given a bipartite graph, find a minimum cardinality set of edges which intersect every vertex cover

What rule features form persistent hierarchical structures in cellular automata?

Decidable fragment of second-order logic

Hot Network Questions