Inductive counting below logspace (Q5096885)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7573190

Language	Label	Description	Also known as
English	Inductive counting below logspace	scientific article; zbMATH DE number 7573190

Statements

scholarly article

0 references

Inductive counting below logspace (English)

0 references

0 references

0 references

Mathematical Foundations of Computer Science 1994

0 references

publication date

18 August 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-58338-6_74

0 references

Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)

0 references

Two Applications of Inductive Counting for Complementation Problems

0 references

The alternation hierarchy for sublogarithmic space is infinite

0 references

0 references

A hierarchy that does not collapse : alternations in low level space

0 references

Nondeterministic Space is Closed under Complementation

0 references

Turing machines that take advice

0 references

0 references

0 references

The method of forced enumeration for nondeterministic automata

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-58338-6_74

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5096885

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