scientific article; zbMATH DE number 1796952

MaRDI QIDQ4551344zbMATH OpenFDO

Authors Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080049

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Algebraic Properties for Selector Functions
• Selection principles related to -properties
• Selectivity in division algebras
• Some properties of the Pisier algebra
• P-selectivity: Intersections and indices
• scientific article; zbMATH DE number 497456
• scientific article; zbMATH DE number 3989426
• scientific article; zbMATH DE number 1273689
• Publication:3470424
• Algebraic characterizations of variable separation properties

Cited in

(7)

• Bounding the complexity of advice functions
• On the advice complexity of tournaments
• scientific article; zbMATH DE number 1543295 (Why is no real title available?)
• Algebraic Properties for Selector Functions
• ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES
• Theory of semi-feasible algorithms
• Optimal advice

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 Q4551344)