Cluster computing and the power of edge recognition

DOI10.1016/J.IC.2007.02.001zbMATH Open1121.68099OpenAlexW2169083964MaRDI QIDQ2643084FDOQ2643084

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

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

zbMATH Keywords

cluster class CL\#P

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)