scientific article; zbMATH DE number 1929932

zbMATH Open1014.68504MaRDI QIDQ4708564FDOQ4708564

Beate Bollig, Philipp Woelfel

Publication date: 18 June 2003

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
• Title not available (Why is that?)
• Lower bounds for restricted read-once parity branching programs
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

   Recommendations

• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications 👍 👎
• Title not available (Why is that?) 👍 👎
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication 👍 👎
• Title not available (Why is that?) 👍 👎
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs 👍 👎

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