Yasuhiko Takenaga

Available identifiers

Publication	Date of Publication	Type
QUIXO is EXPTIME-complete	2020-10-07	Paper
Matchstick puzzles on a grid	2020-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q5405470	2014-04-02	Paper
PSPACE-completeness of an escape problem	2010-06-09	Paper
Tetravex is NP-complete	2010-01-29	Paper
Vertex Coloring of Comparability+ke and –ke Graphs	2008-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4548335	2002-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4331297	2002-05-15	Paper
Tree-shellability of Boolean functions	2002-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q2743810	2001-09-17	Paper
Hardness of indentifying the minimum ordered binary decision diagram	2001-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4525752	2001-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4937842	2000-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4937167	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4937168	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4937211	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4935135	2000-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4705514	1999-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4703652	1999-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4364580	1998-11-04	Paper
Size of ordered binary decision diagrams representing threshold functions	1998-07-22	Paper

This page was built for person: Yasuhiko Takenaga