scientific article; zbMATH DE number 1335889

zbMATH Open0935.68027MaRDI QIDQ4258580FDOQ4258580

Authors: Hartmut Klauck 

Publication date: 13 September 1999

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

Recommendations

• scientific article; zbMATH DE number 1256774
• Nondeterministic Communication with a Limited Number of Advice Bits
• Lower bounds for the size of nondeterministic circuits
• Non-deterministic communication complexity with few witnesses

zbMATH Keywords

limited nondeterministic communication

Mathematics Subject Classification ID

Cited In (11)

• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
• Lower Bounds for Testing Computability by Small Width OBDDs
• On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
• Communication complexity method for measuring nondeterminism in finite automata
• Nondeterminism and an abstract formulation of Nečiporuk's lower bound method
• The communication complexity of pointer chasing
• Lower bounds for the size of nondeterministic circuits
• Nondeterministic Communication with a Limited Number of Advice Bits
• Strong co-nondeterministic lower bounds for NP cannot be proved feasibly

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