scientific article; zbMATH DE number 4112003

MaRDI QIDQ3835018zbMATH OpenFDO

Authors Zalán Bodó

Publication date 1988

zbMATH Keywords

monotone circuitsmonotone problempolynomial size circuits

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Model theory of finite structures (03C13) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Numerical evaluation of multiple polylogarithms
• An additive decomposition in multiple logarithmic extensions
• Polylogarithms
• scientific article; zbMATH DE number 510287
• scientific article; zbMATH DE number 3867433
• Single-valued multiple polylogarithms in one variable
• Additive polylogarithms and their functional equations
• On polylogarithms

Cited in

(2)

• scientific article; zbMATH DE number 549850 (Why is no real title available?)
• Addition is exponentially harder than counting for shallow monotone circuits

This page was built for publication:

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