Explore our questions

1 vote
1 answer
19 views

What are some practical applications of inductive-inductive and inductive-recursive types?

0 votes
0 answers
16 views

Is there any augmenting graph algorithm available for find maximum independent set problem in K1,4 free graph

0 votes
0 answers
24 views

Reductions That Acts on Witnesses

-2 votes
0 answers
36 views

Can any suggest good algorithmic problem on automata theory

0 votes
0 answers
9 views

How well can shortest common supersequence over small alphabet size be approximated?

13 votes
1 answer
617 views

Recent progress on the next-to-shortest-path problem for directed graphs?

5 votes
0 answers
71 views

How to prove clock equivalence is a time-abstracted bisimulation

0 votes
1 answer
70 views

Detecting Erroneous Corrections

-1 votes
0 answers
69 views

Are there any problems that take Sub-Exponential time outside of PSPACE?

8 votes
1 answer
219 views

Is any function between $n$ and $n\log n$ time-constructible on a 1-tape TM?

7 votes
2 answers
292 views

Proving #P-hardness for the number of subsets of a set of positive integers with a sum of at most T?

1 vote
1 answer
162 views

Is (Restricted) Bigraph Isomorphism Weaker than Graph Isomorphism?

0 votes
0 answers
38 views

Algorithm to remove unnecessary productions from context-free grammar

0 votes
1 answer
70 views

Polynomial time algorihtms for two variants of the decision version of longest walk problem

Browse more Questions