Separating Complexity Classes With Tally Oracles

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(92)90318-a
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Separating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines

English

Classes of Boolean Functions With Limited Complexity

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

The Complexity of Separating Points in the Plane

2013English

Equilibria, Fixed Points, and Complexity Classes

Computer Science Review
Computer ScienceTheoretical Computer Science
2009English

Specification-Based Test Oracles With JUnit

2010English

Instruction Sequence Based Non-Uniform Complexity Classes

Scientific Annals of Computer Science
Applied MathematicsComputer Science
2014English

The Structure of Logarithmic Advice Complexity Classes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1998English

Dense and Non-Dense Families of Complexity Classes

1969English

Ω-Rational Languages: High Complexity Classes vs. Borel Hierarchy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy