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

A 23 log 3-competitive algorithm for the counterfeit coin problem

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

DOI10.1007/bfb0030863zbMath1527.68146OpenAlexW1644837885MaRDI QIDQ6085738

Dean F. Kelley, Qi-Fan Yang, Peng-Jun Wan

Publication date: 12 December 2023

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

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



Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Enumerative combinatorics (05A99)




Cites Work

  • A new competitive algorithm for the counterfeit coin problem
  • Unnamed Item


This page was built for publication: A 23 log 3-competitive algorithm for the counterfeit coin problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6085738&oldid=35527566"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 06:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki