On the Connection between Interval Size Functions and Path Counting

DOI10.1007/978-3-642-02017-9_14MaRDI QIDQ3630195zbMATH OpenOpenAlexFDO

Authors Evangelos Bampas, Andreas Göbel, Aris Pagourtzis, Aris Tentes

Publication date 3 June 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the connection between interval size functions and path counting
• The Complexity of Counting Functions with Easy Decision Version
• Completeness results for counting problems with easy decision
• The Complexity of Computing the Size of an Interval
• scientific article; zbMATH DE number 1754654

Cited in

(7)

• The Complexity of Counting Functions with Easy Decision Version
• Completeness results for counting problems with easy decision
• Stathis Zachos at 70!
• On the connection between interval size functions and path counting
• The Complexity of Computing the Size of an Interval
• scientific article; zbMATH DE number 1754654 (Why is no real title available?)
• scientific article; zbMATH DE number 1953880 (Why is no real title available?)

This page was built for publication: On the Connection between Interval Size Functions and Path Counting

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