Q3191148 (Q3191148): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:31, 9 July 2024

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

B. V. Raghavendra Rao

0 references

M. N. Jayalal Sarma

0 references

Chicago Journal of Theoretical Computer Science

0 references

publication date

24 September 2014

0 references

zbMATH Keywords

space complexity

0 references

reachability problems

0 references

matroid theory

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.4086/cjtcs.2014.005

0 references

Reachability Problems: An Update

0 references

0 references

Computational Complexity

0 references

Problems complete for deterministic logarithmic space

0 references

A characterisation of binary transversal structures

0 references

A note on closure properties of logspace MOD classes

0 references

Gammoids and transversal matroids

0 references

Space-bounded reducibility among combinatorial problems

0 references

Inequivalent Representations of Bias Matroids

0 references

Matroid Complexity and Nonsuccinct Descriptions

0 references

0 references

Maze recognizing automata and nondeterministic tape complexity

0 references

Connectivity in Matroids

0 references

On the Abstract Properties of Linear Dependence

0 references

Identifiers

zbMATH Open document ID

0 references

10.4086/cjtcs.2014.005

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3191148

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