Back to Results
First PageMeta Content
NP-complete / NP / P / Combinatory logic / P versus NP problem / Computational complexity theory / Theoretical computer science / Complexity classes / Applied mathematics


Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2
Add to Reading List

Document Date: 2001-12-13 15:38:53

Open Document

File Size: 304,72 KB

Share Result on Facebook

City

Princeton / Buffalo / /

Company

P. / S. / Wilson / /

/

Event

Product Issues / Product Recall / /

Facility

NEC Research Institute / /

IndustryTerm

deterministic algorithm / /

Organization

Department of Computer Science and Engineering / NEC Research Institute / /

/

Position

author / /

Product

Both PadSAT / P ≤P r / /

ProgrammingLanguage

L / /

ProvinceOrState

New Jersey / New York / /

Technology

deterministic algorithm / following algorithm / /

SocialTag