scientific article
From MaRDI portal
Publication:3191148
DOI10.4086/cjtcs.2014.005zbMath1372.68144OpenAlexW4231490181MaRDI QIDQ3191148
B. V. Raghavendra Rao, M. N. Jayalal Sarma
Publication date: 24 September 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2014.005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Space-bounded reducibility among combinatorial problems
- A note on closure properties of logspace MOD classes
- Maze recognizing automata and nondeterministic tape complexity
- A characterisation of binary transversal structures
- Gammoids and transversal matroids
- Matroid Complexity and Nonsuccinct Descriptions
- Problems complete for deterministic logarithmic space
- On the Abstract Properties of Linear Dependence
- Computational Complexity
- Reachability Problems: An Update
- Connectivity in Matroids
- Inequivalent Representations of Bias Matroids
This page was built for publication: