SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMATH Open1175.03024OpenAlexW2756057450MaRDI QIDQ5897993FDOQ5897993

Authors: Lane A. Hemaspaandra, Leen Torenvliet 

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Recommendations

• P-selectivity: Intersections and indices
• Reducibility classes of P-selective sets
• A note on P-selective sets and closeness
• \(p\)-selective self-reducible sets: a new characterization of P
• scientific article; zbMATH DE number 1665448

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (1)

• On the complexity of kings

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science

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