Logarithmic advice classes (Q1193903)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Logarithmic advice classes	scientific article

Statements

scholarly article

0 references

Logarithmic advice classes (English)

0 references

zbMATH Open document ID

0 references

10.1016/0304-3975(92)90353-H

0 references

José L. Balcázar

0 references

0 references

Theoretical Computer Science

0 references

publication date

27 September 1992

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

log-bounded advice

0 references

sparse oracle in NP

0 references

MaRDI profile type

MaRDI publication profile

0 references

The polynomial-time hierarchy and sparse oracles

0 references

On characterizations of the class PSPACE/poly

0 references

0 references

On Isomorphisms and Density of $NP$ and Other Complete Sets

0 references

Tally languages and complexity classes

0 references

Computational Complexity of Probabilistic Turing Machines

0 references

On sparse sets in NP-P

0 references

Sparse sets in NP-P: EXPTIME versus NEXPTIME

0 references

Computation times of NP sets of different densities

0 references

On self-reducibility and weak P-selectivity

0 references

On helping by robust oracle machines

0 references

On Circuit-Size Complexity and the Low Hierarchy in NP

0 references

Strong nondeterministic polynomial-time reducibilities

0 references

A low and a high hierarchy within NP

0 references

On small generators

0 references

Complexity of Presburger arithmetic with fixed quantifier dimension

0 references

Polynomial Time Enumeration Reducibility

0 references

0 references

The polynomial-time hierarchy

0 references

Some consequences of non-uniform conditions on uniform classes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1193903

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1193903&oldid=34092579"