Who publishes Computational Complexity?

Computational Complexity is published by Springer.

What is the ISSN of Computational Complexity?

The ISSN of Computational Complexity is 1016-3328.

What is the impact factor of Computational Complexity?

The reported impact factor of Computational Complexity is 1.0. Impact factor values are reproduced from publishers and may lag the latest JCR release.

What is the CCF ranking of Computational Complexity?

Computational Complexity is ranked CCF B in the China Computer Federation journal catalogue.

저널 정보

Computational Complexity (CC)

저널 웹사이트를 보려면 로그인해 주세요

무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.

회원가입 로그인

영향력 지수:

1.0

출판사:

Springer

ISSN:

1016-3328

조회:

16724

팔로우:

0

이 페이지에 잘못된 정보가 있나요? 알려 주세요

이 데이터를 API로 가져오기

검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.

CC 의 논문 모집을 놓치지 마세요

무료 계정을 만들면 이 저널이 새 논문 모집이나 특집호를 공개할 때마다 이메일로 알려드립니다.

새 논문 모집을 알려주세요 이미 계정이 있으신가요? 로그인

계정은 무료입니다. 이메일은 하루 최대 한 통이며, 모든 이메일에 원클릭 수신거부 링크가 있습니다.

논문 모집

Computational Complexity (CC) is an academic journal published by Springer. (ISSN 1016-3328, impact factor 1.0, CCF B).

Aims and scope computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case Specific areas of concentration include: Structure of complexity classes (reductions, relativization questions, degrees, derandomization) Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations) Interactive proofs, pseudorandom generation, and randomness extraction Complexity issues in: cryptography learning theory number theory logic (complexity of logical theories, cost of decision procedures) combinatorial optimization and approximate solutions distributed computing property testing

최종 수정: Dou Sun (2026-01-10)

CCF	정식 명칭	영향력 지수	출판사	ISSN
C	Computer Communications	4.3	Elsevier	0140-3664
	Complexity	1.7	Hindawi	1076-2787
	Computational Management Science	1.3	Springer	1619-697X
	Journal of Computational Electronics	2.5	Springer	1569-8025
	Computational Optimization and Applications	2.0	Springer	0926-6003
	Computational Social Networks		Springer	2197-4314
	Computational Mechanics	3.8	Springer	0178-7675
	Computational Statistics	1.4	Springer	0943-4062
	Journal of Computational Analysis and Applications		Springer	1521-1398
	Computational Economics	2.2	Springer	0927-7099

CCF	ICORE	CP-I	약칭	정식 명칭	투고 마감	개최일
		35.8	CC'	IEEE International Conference on Conversational Computing	2020-10-15	2020-12-09
B	B	82.9	CC	International Conference on Compiler Construction	2025-11-10	2026-01-31
	C	54.2	ICCI*CC	International Conference on Cognitive Informatics & Cognitive Computing	2023-05-22	2023-08-19
B	A	79.0	CCC	IEEE Conference on Computational Complexity	2026-02-06	2026-08-03
B	A*	89.7	ICRA	International Conference on Robotics and Automation	2026-09-15	2027-05-24
B	A*	94.2	IJCAI	International Joint Conference on Artificial Intelligence	2026-01-31	2026-08-15
B		91.2	ICASSP	International Conference on Acoustics, Speech and Signal Processing	2026-09-16	2027-05-16
B	A*	79.7	PODS	ACM SIGMOD Conference on Principles of DB Systems	2026-12-03	2027-06-13
B	A	76.6	ICME	International Conference on Multimedia and Expo	2025-12-31	2026-07-05
B		84.4	BIBM	International Conference on Bioinformatics & Biomedicine	2026-07-05	2026-12-01

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요

저널 정보

Computational Complexity (CC)

논문 모집

관련 저널

관련 학회

댓글 0