Skip to main content
Theoretical Computer Science

Explore our questions

Ask Question
more tags
Active Hot Week Month
7 votes
1 answer
465 views

Decidable fragment of second-order logic

Reijo Jaakkola's user avatar
Reijo Jaakkola
3 votes
0 answers
37 views

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

Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk
1 vote
1 answer
89 views

Parameterised Problems: fpt when VC-dimension is bounded

tropurchan's user avatar
tropurchan
0 votes
1 answer
69 views

How do magic set transformation work for nonlinear recursion?

Louis's user avatar
Louis
0 votes
0 answers
23 views

Read once per pivot resolution completeness

maikio's user avatar
maikio
0 votes
0 answers
46 views

Semidecidability of reachability of two register Minsky machine

user1868607's user avatar
user1868607
1 vote
0 answers
113 views

DP resolution over degree bounded CNF

maikio's user avatar
maikio
6 votes
0 answers
142 views

Computable functions with continuation

Trebor's user avatar
Trebor
0 votes
0 answers
56 views

Can holographic computer be understood as structural computation beyond classical and quantum computing?

O-D's user avatar
O-D
5 votes
1 answer
414 views

What is the time complexity of fermionic Fourier transform?

Community's user avatar
CommunityBot
7 votes
1 answer
332 views

Complexity of the Partition problem in the Real RAM model

Erel Segal-Halevi's user avatar
Erel Segal-Halevi
1 vote
1 answer
154 views

Is this special case of quadratic programming NP-hard?

Erel Segal-Halevi's user avatar
Erel Segal-Halevi
2 votes
0 answers
73 views

Löwenheim-Skolem theorem in many-sorted first-order logic

Nicola Gigante's user avatar
Nicola Gigante
7 votes
1 answer
385 views

Is the following problem PPA-complete?

Emil Jeřábek's user avatar
Emil Jeřábek
Browse more Questions