Skip header Section
Skip Bibliometrics Section
The Complexity of ComputingFebruary 1987
- Author:
- John E. Savage
Abstract
No abstract available.
Cited By
- Cook S Towards a Complexity Theory of Synchronous Parallel Computation Logic, Automata, and Computational Complexity, (219-244)
- Cook S The 1982 ACM Turing Award Lecture Logic, Automata, and Computational Complexity, (47-70)
- Eslami F and Wilton S (2018). Rapid Triggering Capability Using an Adaptive Overlay during FPGA Debug, ACM Transactions on Design Automation of Electronic Systems, 23:6, (1-25), Online publication date: 30-Nov-2018.
- Druk E and Ishai Y Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications Proceedings of the 5th conference on Innovations in theoretical computer science, (169-182)
- Cook S An overview of computational complexity ACM Turing award lectures
- Myasnikov A Generic complexity of undecidable problems Proceedings of the Second international conference on Computer Science: theory and applications, (407-417)
- Iwama K, Sawada S, Hino K and Kurokawa H Random Benchmark Circuits with Controlled Attributes Proceedings of the 1997 European conference on Design and Test
- Tanaka K and Nishino T On the complexity of negation-limited Boolean networks Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (38-47)
- Adleman L and Kompella K Using smoothness to achieve parallelism Proceedings of the twentieth annual ACM symposium on Theory of computing, (528-538)
- Buss S The Boolean formula value problem is in ALOGTIME Proceedings of the nineteenth annual ACM symposium on Theory of computing, (123-131)
- Beekman J, Owens R and Irwin M Mesh arrays and LOGICIAN: a tool for their efficient generation Proceedings of the 24th ACM/IEEE Design Automation Conference, (357-362)
- Ajtai M, Babai L, Hajnal P, Komlos J and Pudlak P Two lower bounds for branching programs Proceedings of the eighteenth annual ACM symposium on Theory of computing, (30-38)
- Beame P Limits on the power of concurrent-write parallel machines Proceedings of the eighteenth annual ACM symposium on Theory of computing, (169-176)
- Holtkamp B and Wagner P (1984). An algorithm for selection of migration candidates, ACM SIGMICRO Newsletter, 15:4, (140-146), Online publication date: 1-Dec-1984.
- Holtkamp B and Wagner P An algorithm for selection of migration candidates Proceedings of the 17th annual workshop on Microprogramming, (140-146)
- Alt H Comparison of arithmetic functions with respect to boolean circuit depth Proceedings of the sixteenth annual ACM symposium on Theory of computing, (466-470)
- Asai H and Cheng C (1983). Speeding up an overrelaxation method of division in Radix-2 machine, Communications of the ACM, 26:3, (216-220), Online publication date: 1-Mar-1983.
- Cook S (1983). An overview of computational complexity, Communications of the ACM, 26:6, (400-408), Online publication date: 1-Jun-1983.
- Valiant L Exponential lower bounds for restricted monotone circuits Proceedings of the fifteenth annual ACM symposium on Theory of computing, (110-117)
- Mandrioli D (1982). On teaching theoretical foundations of Computer Science, ACM SIGACT News, 14:4, (58-69), Online publication date: 1-Sep-1982.
- Kissin G Measuring energy consumption in VLSI circuits Proceedings of the fourteenth annual ACM symposium on Theory of computing, (99-104)
- Tanik M (1981). Prediction models for cyclomatic complexity, ACM SIGPLAN Notices, 16:4, (89-97), Online publication date: 1-Apr-1981.
- Asai H (1980). An overrelaxation for a numerical inverse of a constant, Communications of the ACM, 23:9, (503-510), Online publication date: 1-Sep-1980.
- Brent R and Kung H The chip complexity of binary arithmetic Proceedings of the twelfth annual ACM symposium on Theory of computing, (190-200)
- Kafatou T (1979). Selection and evaluation of EDP equipment, ACM SIGSMALL Newsletter, 5:4, (5-8), Online publication date: 1-Aug-1979.
- Hunt H and Rosenkrantz D The complexity of testing predicate locks Proceedings of the 1979 ACM SIGMOD international conference on Management of data, (127-133)
- Valiant L Negation can be exponentially powerful Proceedings of the eleventh annual ACM symposium on Theory of computing, (189-196)
- Valiant L Completeness classes in algebra Proceedings of the eleventh annual ACM symposium on Theory of computing, (249-261)
- Wegener I Switching functions whose monotone complexity Proceedings of the tenth annual ACM symposium on Theory of computing, (143-149)
- Valiant L Universal circuits (Preliminary Report) Proceedings of the eighth annual ACM symposium on Theory of computing, (196-203)
- Paul W A 2.5 n-lower bound on the combinational complexity of Boolean functions Proceedings of the seventh annual ACM symposium on Theory of computing, (27-36)
- Valiant L On non-linear lower bounds in computational complexity Proceedings of the seventh annual ACM symposium on Theory of computing, (45-53)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Granular computing and computational complexity
RSKT'10: Proceedings of the 5th international conference on Rough set and knowledge technologyGranular computing is to imitate humans multigranular computing strategy to problem solving in order to endow computers with the same capability. Its final goal is to reduce the computational complexity. To the end, based on the simplicity principle the ...
Sky Computing
Infrastructure-as-a-service (IaaS) cloud computing is revolutionizing how we approach computing. Compute resource consumers can eliminate the expense inherent in acquiring, managing, and operating IT infrastructure and instead lease resources on a pay-...