The Complexity of Computing the Size of an Interval
From MaRDI portal
cluster computingcomplexity classescomputational complexitycounting functionsinterval size functions
Complexity of computation (including implicit computational complexity) (03D15) Partial orders, general (06A06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- scientific article; zbMATH DE number 1754654
- On the connection between interval size functions and path counting
- On the Connection between Interval Size Functions and Path Counting
- Why intervals? Because if we allow other sets, tractable problems become intractable
- Polynomial Space Counting Problems
Cited in
(13)- Computational complexity and feasibility of data processing and interval computations
- Completeness, approximability and exponential time results for counting problems with easy decision version
- 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
- Complexity estimates depending on condition and round-off error
- On the Connection between Interval Size Functions and Path Counting
- scientific article; zbMATH DE number 1346365 (Why is no real title available?)
- scientific article; zbMATH DE number 1754654 (Why is no real title available?)
- The consequences of eliminating NP solutions
- Completeness results for counting problems with easy decision
- Stathis Zachos at 70!
- Complexity classes of equivalence problems revisited
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 Q5422486)
