15 papers
A Computation Model with Automatic Functions and Relations as Primitive Operations
Ziyuan Gao, Sanjay Jain, Li Zeyong +2
Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd and Knuth (Floyd and Knuth, 1990) investigated what happens if a device uses primitive steps more natural th…
Ordered Semiautomatic Rings with Applications to Geometry
Ziyuan Gao, Sanjay Jain, Ji Qi +3
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geome…
Improved Algorithms for the General Exact Satisfiability Problem
Gordon Hoi, Frank Stephan
The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned , while the rest are all ass…
Learnability and Positive Equivalence Relations
David Belanger, Ziyuan Gao, Sanjay Jain +2
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence…
members of thin classes and generic degrees
Frank Stephan, Guohua Wu, Bowen Yuan
A class is thin if every subclass of is the intersection of with some clopen set. In 1993, Cenzer, Downey, Jockusch and Shore initiated the…
A Faster Exact Algorithm to Count X3SAT Solutions
Gordon Hoi, Sanjay Jain, Frank Stephan
The Exact Satisfiability problem, XSAT, is defined as the problem of finding a satisfying assignment to a formula in CNF such that there is exactly one literal in each clause assig…