Circuits and Expressions over Finite Semirings

DOI10.1145/3241375zbMATH Open1485.68106OpenAlexW2889360129WikidataQ129270182 ScholiaQ129270182MaRDI QIDQ5205797FDOQ5205797

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

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
• Publication:4893205

zbMATH Keywords

semiringsexpression evaluationcircuit evaluation problem

Mathematics Subject Classification ID

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

Cited In (5)

• Linear circuits, two-variable logic and weakly blocked monoids
• Title not available (Why is that?)
• Circuit evaluation for finite semirings
• Title not available (Why is that?)
• Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids

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)