Mikhail Rudoy

From MaRDI portal
Person:1637230

Available identifiers

zbMath Open rudoy.mikhailMaRDI QIDQ1637230

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50889362022-07-18Paper
Circumscribing polygons and polygonizations for disjoint line segments2022-06-03Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible2020-09-03Paper
https://portal.mardi4nfdi.de/entity/Q51164962020-08-25Paper
Computational complexity of motion planning of a robot through simple gadgets2020-08-11Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible2020-08-11Paper
Computational complexity of generalized Push Fight2020-08-11Paper
Solving the Rubik's Cube Optimally is NP-complete2020-08-05Paper
Cookie clicker2020-04-03Paper
A simple proof that the \((n^{2} - 1)\)-puzzle is hard2018-06-07Paper
Dissection with the fewest pieces is hard, even to approximate2017-02-01Paper

Research outcomes over time

This page was built for person: Mikhail Rudoy

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1637230&oldid=6284503"
Powered by MediaWiki