The complexity of computing the size of an interval

DOI10.1007/3-540-48224-5_84MaRDI QIDQ4535082zbMATH OpenFDO

Authors Lane A. Hemaspaandra, Sven Kosub, K. W. Wagner

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Complexity of Computing the Size of an Interval
• On the Connection between Interval Size Functions and Path Counting
• On the connection between interval size functions and path counting
• Counting interval orders
• Why intervals? Because if we allow other sets, tractable problems become intractable

Cited in

(7)

• Computational complexity and feasibility of data processing and interval computations
• A structured view on weighted counting with relations to counting, quantum computation and applications
• On the connection between interval size functions and path counting
• Cluster computing and the power of edge recognition
• On the Connection between Interval Size Functions and Path Counting
• scientific article; zbMATH DE number 1346365 (Why is no real title available?)
• The Complexity of Computing the Size of an Interval

This page was built for publication: The complexity of computing the size of an interval

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