Write in a clean editor, then format for ACM Transactions on Computation Theory in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM Transactions on Computation Theory is a peer-reviewed journal published by ACM, covering Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Machine Learning and Algorithms. Over its lifetime it has published 355 papers, which have received 3,755 citations.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Computation Theory 12, 3, Article 45 (2023).
Formats any DOI in ACM Transactions on Computation Theory style. No sign-up. |
| Publishes research in | Complexity and Algorithms in Graphs Advanced Graph Theory Research Machine Learning and Algorithms Cryptography and Data Security Computability, Logic, AI Algorithms |
| ISSN | 1942-3454 |
| Citation impact (2-yr) | 0.6 |
| h-index | 23 |
| i10-index | 66 |
| Top institutions publishing here | University of Oxford |
| Journal website | portal.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work is a new way of constructing leveled, fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits of a-priori bounded depth), without Gentry’s bootstrapping procedure. Specifically, we offer…
Any proof of P ≠ NP will have to overcome two barriers: relativization and natural proofs . Yet over the last decade, we have seen circuit lower bounds (e.g., that PP does not have linear-size circuits) that overcome both barriers simultaneously. So the question arises of whether there is a third barrier to progress on…
We present a simple algorithm that approximates the product of n -by- n real matrices A and B . Let ‖AB‖ F denote the Frobenius norm of AB , and b be a parameter determining the time/accuracy trade-off. Given 2-wise independent hash functions h 1 , h 2 : [ n ]→ [ b ],…
We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the node multiway cut problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating cut, resolving an open problem…
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many nonelementary problems. This hierarchy allows the classification of many decision problems with a nonelementary complexity, which occur naturally in areas such as logic, combinatorics, formal languages, and verification, with complexities ranging from simple towers of exponentials to Ackermannian…
ACM Transactions on Mathematical Software
ACM Transactions on Modeling and Performance Evaluation of Computing Systems
ACM Transactions on Parallel Computing
ACM Transactions on Probabilistic Machine Learning
ACM Transactions on Quantum Computing
ACM Transactions on Reconfigurable Technology and Systems
IEEE Electron Devices Magazine
IEEE Industry Applications Magazine
