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

doi 10.1109/sct.1989.41831
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc. Press

Related search

Separating Complexity Classes With Tally Oracles

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1992English

The Structure of Logarithmic Advice Complexity Classes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1998English

Coercive Inequalities for Certain Classes of Bounded Regions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

Four Small Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Ultrametric Automata and Turing Machines

English

Logical Depth for Reversible Turing Machines With an Application to the Rate of Decrease in Logical Depth for General Turing Machines

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Small Semi-Weakly Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Preservation of Logarithmic Concavity by the Mellin Transform and Applications to the Schrödinger Equation for Certain Classes of Potentials

Communications in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
1990English

Conversion From Arithmetic to Boolean Masking With Logarithmic Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy