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

Winning a Pool Is Harder Than You Thought

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

DOI10.4169/COLLEGE.MATH.J.47.5.347zbMath1442.97056OpenAlexW2553698820MaRDI QIDQ4581615

John P. Bonomo

Publication date: 20 August 2018

Published in: The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4169/college.math.j.47.5.347



Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Education of mathematical modeling and applications of mathematics (97M99) Theoretical computer science (educational aspects) (97P20) Artificial intelligence (educational aspects) (97P80)





Cites Work

  • Unnamed Item
  • Reducibility among Combinatorial Problems
  • The complexity of theorem-proving procedures




This page was built for publication: Winning a Pool Is Harder Than You Thought

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4581615&oldid=18720370"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 12:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki