research
∙
01/18/2022
A Computation Model with Automatic Functions and Relations as Primitive Operations
Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd ...
share
research
∙
01/10/2022
An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs
The Maximum Induced Matching problem asks to find the maximum k such tha...
research
∙
11/17/2021
Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth
Floyd and Knuth investigated in 1990 register machines which can add, su...
research
∙
11/08/2021
Alternating Automatic Register Machines
This paper introduces and studies a new model of computation called an A...
research
∙
01/21/2021
Improved Algorithms for the General Exact Satisfiability Problem
The Exact Satisfiability problem asks if we can find a satisfying assign...
research
∙
11/25/2020
Learnability and Positive Equivalence Relations
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated wh...
research
∙
07/15/2020
A Faster Exact Algorithm to Count X3SAT Solutions
The Exact Satisfiability problem, XSAT, is defined as the problem of fin...
research
∙
10/03/2019
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
X3SAT is the problem of whether one can satisfy a given set of clauses w...
research
∙
01/15/2019
Random Subgroups of Rationals
This paper introduces and studies a notion of algorithmic randomness for...
research
∙
01/05/2018
Equivalences between learning of data and probability distributions, and their applications
Algorithmic learning theory traditionally studies the learnability of ef...
research
∙
10/31/2017
Algorithmic learning of probability distributions from random data in the limit
We study the problem of identifying a probability distribution for some ...
research
∙
09/26/2017
