LA, permutations, and the Hajós calculus

DOI10.1016/j.tcs.2005.09.021zbMath1090.03031OpenAlexW2009536531MaRDI QIDQ2581274

Michael Soltys

Publication date: 9 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.021

zbMATH Keywords

permutationsmatrix algebraproof complexity

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Complexity of proofs (03F20)

Cites Work

• Unnamed Item
• Exponential lower bounds for the pigeonhole principle
• Matrix identities and the pigeonhole principle
• Simplified lower bounds for propositional proofs
• The proof complexity of linear algebra
• The Complexity of the Hajós Calculus

This page was built for publication: LA, permutations, and the Hajós calculus