scientific article; zbMATH DE number 2079872

zbMATH Open1043.68557MaRDI QIDQ4471998FDOQ4471998

Authors: Stanislav Zak, Stasys Jukna 

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1963/19630356.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4047114
• A lower bound for read-once-only branching programs
• A direct-sum theorem for read-once branching programs
• A note on read-$k$ times branching programs
• On the complexity of randomized read-once branching programs
• scientific article; zbMATH DE number 549860
• Information-flow and data-flow analysis of while-programs
• scientific article; zbMATH DE number 1775455
• scientific article; zbMATH DE number 1759451
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (2)

• On uncertainty versus size in branching programs.
• Title not available (Why is that?)

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 Q4471998)