Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Berkowitz's algorithm and clow sequences

From MaRDI portal
Publication:2783464
Jump to:navigation, search

DOI10.13001/1081-3810.1072zbMath0998.65047arXivmath/0201315OpenAlexW2110783597MaRDI QIDQ2783464

Michael Soltys

Publication date: 23 April 2002

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

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


zbMATH Keywords

characteristic polynomialparallel algorithmBoolean circuitsBerkowitz's algorithmclosed walk sequencesclow sequencecomputational and proof complexity


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Complexity and performance of numerical algorithms (65Y20) Canonical forms, reductions, classification (15A21)








This page was built for publication: Berkowitz's algorithm and clow sequences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2783464&oldid=15670926"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki