scientific article; zbMATH DE number 1500514

zbMATH Open0959.68522MaRDI QIDQ4501529FDOQ4501529

Authors: Juraj Hromkovič, Martin Sauerhoff 

Publication date: 26 April 2001

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

Recommendations

• scientific article; zbMATH DE number 1688365
• The power of nondeterminism and randomness for oblivious branching programs
• On multi-partition communication complexity
• Communication-Space Tradeoffs for Unrestricted Protocols

zbMATH Keywords

multipartition protocols

Mathematics Subject Classification ID

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

Cited In (13)

• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
• Approximation of boolean functions by combinatorial rectangles
• Title not available (Why is that?)
• On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
• On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
• On the power of randomized multicounter machines
• The power of nondeterminism and randomness for oblivious branching programs
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• Nondeterministic Communication with a Limited Number of Advice Bits
• Width hierarchy for \(k\)-OBDD of small width
• On multi-partition communication complexity

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