scientific article; zbMATH DE number 1543037

zbMATH Open0960.68078MaRDI QIDQ4520487FDOQ4520487

Authors: Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe 

Publication date: 26 February 2001

Full work available at URL: http://www.jucs.org/jucs_3_3/polynomial_time

Title of this publication is not available (Why is that?)

Recommendations

• Reducibility classes of P-selective sets
• Polynomial-Time Membership Comparable Sets
• P-selectivity: Intersections and indices
• NONDETERMINISTICALLY SELECTIVE SETS
• On sets Turing reducible to p-selective sets

zbMATH Keywords

Selman's P-selectivity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (3)

• One query reducibilities between partial information classes
• On polychotomous search problems
• Boolean operations, joins, and the extended low hierarchy

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520487)