Cluster computing and the power of edge recognition

DOI10.1016/J.IC.2007.02.001MaRDI QIDQ2643084zbMATH OpenOpenAlexFDO

Authors Christopher M. Homan, Sven Kosub, Lane A. Hemaspaandra

Publication date 23 August 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2007.02.001

zbMATH Keywords

cluster class CL\#P

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Theory and Applications of Models of Computation
• scientific article; zbMATH DE number 1953880
• The Complexity of Computing the Size of an Interval
• On the power of parity polynomial time
• On the power of parity polynomial time

Cites work

• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• scientific article; zbMATH DE number 1754654 (Why is no real title available?)
• A complexity theory for feasible closure properties
• A note on unambiguous function classes
• A taxonomy of complexity classes of functions
• Bounded Query Classes
• Closure properties and witness reduction
• Complexity Measures for Public-Key Cryptosystems
• On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
• On the closure of certain function classes under integer division by polynomially-bounded functions
• Qualitative relativizations of complexity classes
• Quantitative Relativizations of Complexity Classes
• The Boolean Hierarchy I: Structural Properties
• The Complexity of Computing the Size of an Interval

Cited in

(2)

• The consequences of eliminating NP solutions
• Theory and Applications of Models of Computation

This page was built for publication: Cluster computing and the power of edge recognition

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