The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
Polynomial-Time Membershiop Comparable Sets
Mitsunori Ogihara,
Pages. 1068-1081
Abstract
Contents 1. Introduction
2. Basic properties of polynomial-time membership comparable sets
3. Relationships with P-selective sets
4. Relationships with sparse and tally sets
5. Polynomial-time membership comparable hard sets
Key words P-selective sets, polynomial-time reducibilities, polynomial-size circuits.
Mathmatical Subject Classification 68Q15, 68Q05