STACS 2004

DOI10.1007/B96012zbMATH Open1122.91301OpenAlexW4236485840MaRDI QIDQ5309727FDOQ5309727

Authors: Martin Aigner, Manuela Montangero, Gianluca De Marco 

Publication date: 1 October 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96012

Recommendations

• The plurality problem with three colors and more.
• A plurality problem with three colors and query size three
• STACS 2005
• Probabilistic strategies for the partition and plurality problems
• Randomized strategies for the plurality problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) 2-person games (91A05)

Cited In (8)

• Randomized strategies for the plurality problem
• Probabilistic strategies for the partition and plurality problems
• The plurality problem with three colors and more.
• Computing majority with triple queries
• A plurality problem with three colors and query size three
• Title not available (Why is that?)
• A note on the three color problem
• STACS 2005

This page was built for publication: STACS 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309727)