On regular realizability problems (Q375967)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On regular realizability problems	scientific article

Statements

scholarly article

0 references

On regular realizability problems (English)

0 references

Problems of Information Transmission

0 references

publication date

1 November 2013

0 references

Mikhail N. Vyalyi

0 references

MaRDI profile type

MaRDI publication profile

0 references

On Models of a Nondeterministic Computation

0 references

Computational Complexity

0 references

Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata

0 references

0 references

A note on succinct representations of graphs

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S003294601104003X

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:375967

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