[Other] NP-Completeness of Fill-a-Pix and 曳P2-Completeness of Its Fewest Clues Problem

flymancq Post time Half hour(s) ago | Show all posts |Read mode
This post will be closed automatically in 2026-06-09 17:05
Reward20points

journalㄩIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

AuthorsㄩYuta HIGUCHI; Kei KIMURA

Published dateㄩ2019-11-1

DOIㄩ10.1587/transfun.e102.a.1490

PDF linkㄩhttps://www.jstage.jst.go.jp/art ... 11/E102.A_1490/_pdf

Article linkㄩhttps://doi.org/10.1587/transfun.e102.a.1490

Article SourceㄩInstitute of Electronics, Information and Communications Engineers (IEICE)


Remarkㄩ
Reply

Use magic Donate Report

All Reply0 Show all posts

Reply

You have to log in before you can reply Login | Register

Points Rules

Junior Member
  • post

  • reply

  • points

    30


Daily Top Contributors

Return to the list