scientific article; zbMATH DE number 1953880

MaRDI QIDQ4415064zbMATH OpenFDO

Authors Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2563/25630453.htm

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 4041255
• scientific article; zbMATH DE number 4066859
• On the Connection between Interval Size Functions and Path Counting
• The Complexity of Counting Functions with Easy Decision Version
• Polynomial Space Counting Problems

Cited in

(10)

• Completeness, approximability and exponential time results for counting problems with easy decision version
• On the connection between interval size functions and path counting
• Cluster computing and the power of edge recognition
• scientific article; zbMATH DE number 4041255 (Why is no real title available?)
• THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
• Completeness results for counting problems with easy decision
• Stathis Zachos at 70!
• The Complexity of Counting Functions with Easy Decision Version
• On the power of counting the total number of computation paths of NPTMs
• Closure properties and characterizations of TotP

This page was built for publication:

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