The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Difference Between One and Many (Preliminary Version)
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
On the Power of Random Access Machines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
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.
A lower bound for integer greatest common divisor computations
Journal of the ACM (JACM)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
| Hi-index | 0.00 |
Enumeration problems constitute a major part of combinatorial mathematics. Combinatorial mathematics expresses the solution of enumeration problems by means of solving formulas, generally based on the usual arithmetic operations [7]. These solving formulas can be formally represented as programs for a Random Access Machine (RAM) with arithmetical primitives, for which the natural complexity measure is the arithmetical complexity [1].