Algebraic Properties for Selector Functions

From MaRDI portal

Publication:4651516

Jump to:navigation, search

DOI10.1137/S0097539703427550zbMath1101.68596MaRDI QIDQ4651516

Arfst Nickelsen, Harald Hempel, Hemaspaandra, Lane A.

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

digraphs tournaments associativity immunity commutativity nonuniform complexity selector functions advice complexity computational complexity theory algebraic properties printability P-selectivity nondeterministic selectivity NP-selectivity semifeasible computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES

This page was built for publication: Algebraic Properties for Selector Functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4651516&oldid=18849186"