Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in computer-science

Project euler #1. I keep getting the answer wrong by exactly 100 and I don't know why (written inF#)

f# computer-science

Having a bit of trouble reasoning the formal definition of Big O

Bin-packing (or knapsack?) problem

If a problem X (decision problem) is known to be NP-Complete, and proven to be reduced to problem Y, can you then say problem Y is NP-Complete?

Is there an efficient algorithm to decide whether the language accepted by one NFA is a superset of the language accepted by another?

Decidability and Recursive Enumerability

Compiling objective-c programs without gnustep on ubuntu

Heuristic for Rubik's cube

Multi-start and Multi-end shortest path set

database refinement - minimal cover of F (extraneous attributes)

Priority inversion

CS term for rule matching algorithms on tuples of mandatory and optional conditions

Is the language {0^n 1^n 0^k | k != n} context free?

Rewriting trees

What is the Big-O complexity of my code?

Do algorithms for performing hierarchical permission checking exist?

Rails on Rails taking it to the next level

Why is (a | b ) equivalent to a - (a & b) + b?

Other references to how the Stalin compiler brutally optimizes?

Can two groups of N people find each other around a circle? [closed]