How to write this CFG?...

What does this statement about algorithms mean?...

Can this function be simplified (made more "fast")?...

Where does the constant 5 come from in the median-of-medians algorithm?...

How to convert an NFA to the corresponding Regular Expression?...

how to calculate the turing machine running time?...

Languages to context free grammars...

Converting from Code to a Recurrence Relation...

Why using heuristics in an algorithm takes away asymptotic optimality?...

Is it more efficient to request value or to just automatically set it...

Negation of a regular expression...

BDD Feature & Scenario...

Why is every instance in P also in NP [verifier-based definition]?...

Eliminate this indirect left recursion...

What does the phrase "binds stronger" mean?...

Computer Science in Software Engineering...

Divide list into two equal parts algorithm...

How waterproof is a Swiss cheese?...

Calculating the Computational Complexity (Big-O)...

Computational complexity of a algorithm...

Prove that the problem of factoring α is in NP...

Algorithm to generate context free grammar from any regex...

CFG and its reverse...

simplify regex, [star] mysteriously disappears...

transitive relation in an adjacency matrix...

Infinity confirmation loop...

Is it possible to define subtraction in Primitive Recursion without a predecessor function?...

How to execute a random algorithm...

Is C# 4.0 compile-time turing complete?...

what is the Non-cyclical definition of NP-hard?...