Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding a majority ball with majority answers

From MaRDI portal
Publication:322261
Jump to:navigation, search

DOI10.1016/j.endm.2015.06.047zbMath1386.68113arXiv1509.08276OpenAlexW2130922498MaRDI QIDQ322261

Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Publication date: 14 October 2016

Full work available at URL: https://arxiv.org/abs/1509.08276

zbMATH Keywords

search problemsmajorityplurality


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)


Related Items

The minimum number of vertices in uniform hypergraphs with given domination number



Cites Work

  • Determining the majority
  • Computing majority with triple queries
  • On computing majority by comparisons
  • Variants of the majority problem.
  • The quantum black-box complexity of majority
  • Majority and plurality problems
  • Probabilistic strategies for the partition and plurality problems
  • Density-Based Group Testing
  • Searching for majority with k-tuple queries
  • Search for a majority element
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:322261&oldid=12199217"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki