Back to Results
First PageMeta Content
Complexity classes / NP-complete / Boolean algebra / NP / PP / UP / P / Reduction / Arithmetic circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


Light Up is NP-complete Brandon McPhail February 28, 2005
Add to Reading List

Document Date: 2007-09-02 12:14:45


Open Document

File Size: 135,37 KB

Share Result on Facebook

City

New York / /

Company

PWS Publishing Company / Detecting Unique Solutions / Plenum Press / ACM Press / Nikoli / /

Country

Japan / /

Facility

University of Tokyo / The University of Tokyo / Stetson University / Tokyo Institute of Technology / The University of Birmingham / Reed College / /

Organization

London Mathematical Society / Stetson University / University of Tokyo / Reed College / Tokyo Institute of Technology / University of Birmingham / Association for Computing Machinery / /

Person

Thomas Ryan Wilson / Alan Turing / Takayuki Yato / Jeffrey D. Ullman / Richard M. Karp / David S. Johnson / Michael Sipser / Ian Munro / Therese C. Biedl / Rudolf Fleischer / Lars Jacobsen / Michael R. Garey / Richard Kaye / Nobuhisa Ueda / John P. Hayes / Martin L. Demaine / Michael Hoffman / Christos H. Papadimitriou / Erich Friedman / John E. Hopcroft / Brandon McPhail / Stephen A. Cook / Tadaaki Nagao / Robert A. Hearn / Erik D. Demaine / /

Position

left end / /

ProvinceOrState

Oregon / New York / /

PublishedMedium

The Mathematical Intelligencer / /

URL

http /

SocialTag