Circuits and Expressions over Finite Semirings

DOI10.1145/3241375MaRDI QIDQ5205797zbMATH OpenOpenAlexWikidataFDO

Authors Moses Ganardi, Danny Hucke, Markus Lohrey, D. König

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3241375

zbMATH Keywords

circuit evaluation problemexpression evaluationsemirings

Mathematics Subject Classification ID

Semirings (16Y60) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Circuit evaluation for finite semirings
• scientific article; zbMATH DE number 1358710
• Arithmetic Circuits, Monomial Algebras and Finite Automata
• scientific article; zbMATH DE number 619229
• Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
• scientific article; zbMATH DE number 19616
• Semirings of sets of Boolean operations
• On semisimple semirings
• CC-circuits and the expressive power of nilpotent algebras
• scientific article; zbMATH DE number 922677

Cited in

(5)

• Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
• scientific article; zbMATH DE number 3959281 (Why is no real title available?)
• Linear circuits, two-variable logic and weakly blocked monoids
• Circuit evaluation for finite semirings
• scientific article; zbMATH DE number 3186297 (Why is no real title available?)

This page was built for publication: Circuits and Expressions over Finite Semirings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205797)