Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Polynomial space counting problems
SIAM Journal on Computing
SIAM Journal on Computing
SIAM Journal on Computing
Introduction to the theory of complexity
Introduction to the theory of complexity
Gap-definable counting classes
Journal of Computer and System Sciences
Complexity classes of optimization functions
Information and Computation
A note on unambituous function classes
Information Processing Letters
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On some central problems in computational complexity.
On some central problems in computational complexity.
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We study the complexity of counting the number of elements in intervals of feasible partial orders. Depending on the properties that partial orders may have, such counting functions have different complexities. If we consider total, polynomial-time decidable orders then we obtain exactly the #P functions. We show that the interval size functions for polynomial-time adjacency checkable orders are tightly related to the class FPSPACE(poly): Every FPSPACE(poly) function equals a polynomial-time function subtracted from such an interval size function. We study the function #DIV that counts the nontrivial divisors of natural numbers, and we show that #DIV is the interval size function of a polynomial-time decidable partial order with polynomial-time adjacency checks if and only if primality is in polynomial time.