scientific article; zbMATH DE number 1256774

MaRDI QIDQ4228510zbMATH OpenFDO

Authors Juraj Hromkovič, Georg Schnitger

Publication date 4 October 1999

zbMATH Keywords

nondeterministic communication complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Nondeterministic Communication with a Limited Number of Advice Bits
• scientific article; zbMATH DE number 1335889
• Non-deterministic communication complexity with few witnesses
• Nondeterministic communication complexity with help and graph functions

Cited in

(11)

• A note on non-deterministic communication complexity with few witnesses
• On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
• Communication complexity method for measuring nondeterminism in finite automata
• Nondeterministic communication complexity with help and graph functions
• On the power of laconic advice in communication complexity
• Size complexity of rotating and sweeping automata
• scientific article; zbMATH DE number 1335889 (Why is no real title available?)
• Nondeterministic Communication with a Limited Number of Advice Bits
• Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
• A little advice can be very helpful
• On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata

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