Feasible Combinatorial Matrix Theory

DOI10.1007/978-3-642-40313-2_68zbMath1400.03072arXiv1303.6453OpenAlexW2160564268WikidataQ56970197 ScholiaQ56970197MaRDI QIDQ2849961

Ariel Germán Fernández, Michael Soltys

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

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

zbMATH Keywords

LAmin-max principleproof complexity\(\mathrm{VTC}^{0}\)

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity of proofs (03F20)

This page was built for publication: Feasible Combinatorial Matrix Theory