Deciding First Order Properties of Matroids

From MaRDI portal

Revision as of 05:46, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3167015

Jump to:navigation, search

DOI10.1007/978-3-642-31585-5_24zbMath1367.03022arXiv1108.5457OpenAlexW2281935918MaRDI QIDQ3167015

Tomáš Gavenčiak, Sang-il Oum, Daniel Král'

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.5457

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Decidability of theories and sets of sentences (03B25)

Related Items (4)

First order convergence of matroids ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

This page was built for publication: Deciding First Order Properties of Matroids

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3167015&oldid=16418651"