Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Roy S. Rubinstein
Separating Complexity Classes With Tally Oracles
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Related publications
Separating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines
Classes of Boolean Functions With Limited Complexity
Prikladnaya diskretnaya matematika. Prilozhenie
The Complexity of Separating Points in the Plane
Equilibria, Fixed Points, and Complexity Classes
Computer Science Review
Computer Science
Theoretical Computer Science
Specification-Based Test Oracles With JUnit
Instruction Sequence Based Non-Uniform Complexity Classes
Scientific Annals of Computer Science
Applied Mathematics
Computer Science
The Structure of Logarithmic Advice Complexity Classes
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Dense and Non-Dense Families of Complexity Classes
Ω-Rational Languages: High Complexity Classes vs. Borel Hierarchy
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science