The Complexity of Computing the Size of an Interval
From MaRDI portal
Publication:5422486
DOI10.1137/S0097539705447013zbMath1123.68041MaRDI QIDQ5422486
Christopher M. Homan, Hemaspaandra, Lane A., Sven Kosub, Klaus W. Wagner
Publication date: 22 October 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
computational complexitycluster computingcomplexity classescounting functionsinterval size functions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Completeness Results for Counting Problems with Easy Decision ⋮ Stathis Zachos at 70! ⋮ Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ Cluster computing and the power of edge recognition ⋮ On the connection between interval size functions and path counting ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ The consequences of eliminating NP solutions ⋮ Complexity classes of equivalence problems revisited
This page was built for publication: The Complexity of Computing the Size of an Interval
