ACM Transactions on Computation Theory (TOCT) is a scholarly journal devoted to the study of computational complexity theory and allied fields. TOCT publishes outstanding original research exploring the limits of feasible computation on a quarterly basis.
As the research in the theory of computation and related areas continues to grow in scope, depth, and connections to other fields, TOCT fills an important need in the computer science research community. We particularly welcome submissions in the topic areas listed below, although other research exploring the mathematical nature of computation will also receive full consideration.
- Computational complexity theory
- Foundations of cryptography
- Randomness and pseudorandomness in computing
- Coding theory
- Quantum computation
- Proof complexity
- Computational learning theory
- Computational game theory
- Property testing
- Lower bounds in computational models
- Boolean circuit complexity
- Algebraic complexity
- Parallel and distributed computation
- Communication complexity
- Parameterized complexity
- Inapproximability
- Discrete random systems
- Theoretical issues in other areas (economics, physics, databases, information retrieval, networks, etc.)
ACM Transactions on Computation Theory
Scopus coverage years: from 2009 to Present
Publisher: Association for Computing Machinery
ISSN:1942-3454
E-ISSN:1942-3462
Subject area:
Computer Science: Computational Theory and Mathematics
Mathematics: Theoretical Computer Science
Source type: Journal
Abstracting and Indexing Services
AI2 Semantic Scholar
AMS MathSciNet
Baidu
Clarivate / ISI: ESCI
CNKI
DBLP
DeepDyve
DTU (Technical University of Denmark)
EBSCO: EDS
Elsevier: EI Compendex
Elsevier: SciMago
Elsevier: SCOPUS
EPO (European Patent Office)
ExLibris Google Scholar
IEEE: Xplore
IET Inspec
iGroup
Meta - Chan Zuckerberg Initiative
Microsoft Academic Search
NII (National Institute of Informatics)
OCUL Scholars Portal
Odysci
OhioLink
Pathgather
ProQuest: Summon® Service
SIPX
SUWECO
WorldCat
WTI
Yewno
zbMATH