The structure of logarithmic advice complexity classes
type: Item
instance of: scholarly article
title: The structure of logarithmic advice complexity classes
zbMATH Open document ID: 0912.68045
DOI: 10.1016/S0304-3975(98)00066-8
author: José L. Balcázar
author: M. Hermo
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1238741
zbMATH Keywords: logarithmic advice class
MaRDI profile type: Publication
cites work: Lower bounds for the low hierarchy
cites work: Relating Equivalence and Reducibility to Sparse Sets
cites work: Kolmogorov complexity and degrees of tally sets
cites work: Q4281491
cites work: Upper bounds for the complexity of sparse and tally descriptions
cites work: Sparse Sets, Lowness and Highness
cites work: Q3692867
cites work: Computational power of neural networks: a characterization in terms of Kolmogorov complexity
cites work: Logarithmic advice classes
cites work: On Sets Truth-Table Reducible to Sparse Sets
cites work: Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
cites work: Degrees and reducibilities of easy tally sets
cites work: On the notion of infinite pseudorandom sequences
cites work: On helping by robust oracle machines
cites work: The difference and truth-table hierarchies for NP
cites work: A refinement of the low and high hierarchies
cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
cites work: Instance complexity
cites work: Analog computation via neural networks
cites work: Reducibilities on tally and sparse sets
cites work: Bounded Query Classes
Recommended article: Bounding the complexity of advice functions
Recommended article: Advice classes of parametrized tractability
Recommended article: A Note on the Advice Complexity of Multipass Randomized Logspace
Recommended article: Applicative theories for logarithmic complexity classes
Recommended article: On the Structure of Logspace Probabilistic Complexity Classes
Recommended article: On the structure of log-space probabilistic complexity classes
Recommended article: The relative power of logspace and polynomial time reductions
Recommended article: Advice Complexity and Barely Random Algorithms
Recommended article: ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM
description: scientific article; zbMATH DE number 1238741