◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jeffrey Bosboom

12 papers hereh-index 8810 citations21 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8
  • middle author3

Across the 11 of 12 papers where every author was matched, so the position is known.

fields
  • cs.CC10
  • cs.CG2

identity via Semantic Scholar / OpenAlex

activity
20152022
most citedDissection with the Fewest Pieces is Hard, Even to Approximate

3 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.CC2017★ 1 cited

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

Jeffrey Bosboom, Michael Hoffmann

We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.