Computational Work and Time on Finite Machines

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing

The history and status of the P versus NP question

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Strategic directions in research in theory of computing

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research

Relations Among Complexity Measures

Journal of the ACM (JACM)

Cosmological lower bound on the circuit complexity of a small problem in logic

Journal of the ACM (JACM)

Cryptographic techniques for privacy-preserving data mining

ACM SIGKDD Explorations Newsletter

Polynomial Vicinity Circuits and Nonlinear Lower Bounds

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Comparison of polynomial-time reducibilities

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation

Polynomial time quantum computation with advice

Information Processing Letters

A Discussion of "A Measure of Computational Work"2

IEEE Transactions on Computers

Computational Work of Combinational Machines

IEEE Transactions on Computers

Outlines of a computer model of motivation

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence