Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
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)
A universal interconnection pattern for parallel computers
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
Fast Parallel Computation of Polynomials Using Few Processes
Proceedings on Mathematical Foundations of Computer Science
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
A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Improved parallel algorithms for the depth-first search and monotone circuit value problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
A fast parallel algorithm for the maximal independent set problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for unification and other complete problems in p
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Designing Visual Languages for Description Logics
Journal of Logic, Language and Information
Introduction: complex systems and six challenges for the development of law and the semantic web
AICOL-I/IVR-XXIV'09 Proceedings of the 2009 international conference on AI approaches to the complexity of legal systems: complex systems, the semantic web, ontologies, argumentation, and dialogue
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
| Hi-index | 48.22 |
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.