Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd ...
The Maximum Induced Matching problem asks to find the maximum k such tha...
Floyd and Knuth investigated in 1990 register machines which can add,
su...
This paper introduces and studies a new model of computation called an
A...
The Exact Satisfiability problem asks if we can find a satisfying assign...
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated wh...
The Exact Satisfiability problem, XSAT, is defined as the problem of fin...
X3SAT is the problem of whether one can satisfy a given set of clauses w...
This paper introduces and studies a notion of algorithmic randomness
for...
Algorithmic learning theory traditionally studies the learnability of
ef...
We study the problem of identifying a probability distribution for some ...
An infinite bit sequence is called recursively random if no computable
s...