Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Communications of the ACM
The Complexity of Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Generation of Cryptographically Strong Pseudo-Random Sequences
Proceedings of the 8th Colloquium on Automata, Languages and Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An observation on time-storage trade off
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
Classes of recursive functions of predictable complexity
Classes of recursive functions of predictable complexity
The circuit value problem is log space complete for P
ACM SIGACT News
| Hi-index | 0.00 |