◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. de Bondt

31 papers hereh-index 00 citations0 works total

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

author position
  • sole author20
  • first author5
  • middle author2
  • last author4

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

fields
  • math.AG12
  • math.AC5
  • math.HO5
  • cs.FL3
  • cs.CC2
  • math.RA2

identity via Semantic Scholar / OpenAlex

activity
20072024
most citedThe strong nilpotency index of a matrix

10 citations · 79 across the 27 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2012★ 3 cited

The computational complexity of Minesweeper

Michiel de Bondt

We show that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability. When the probability of locating all mines may be infinitesimal,…

cs.CC2012★ 2 cited

Solving Mahjong Solitaire boards with peeking

Michiel de Bondt

We first prove that solving Mahjong Solitaire boards with peeking is NP-complete, even if one only allows isolated stacks of the forms /aab/ and /abb/. We subsequently show that la…

◍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.