학회 정보

CCA 2026: International Conference on Computability and Complexity in Analysis

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
마감 카운트다운 배지 삽입
CCA
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.
투고 마감일:
2026-05-01
통보일:
2026-06-05
개최일:
2026-07-29
개최지:
Trier, Germany
ICORE: C   조회: 859   팔로우: 0   참가: 0

회반 지수 (CP-I)

46.4 / 100
전체 5,693개 중 2,489위 · 상위 44%

이론·알고리즘 분야 142개 중 93위

학술적 인정 (35%)
58
투고 선별성 (20%) 데이터 없음 — 중립 기준값 50점으로 계산 —
개최 횟수 (20%) 데이터 없음 — 중립 기준값 50점으로 계산 —
커뮤니티 관심도 (10%)
8
공개 자료 충실도 (15%)
35

사용한 입력: 수록 등급: ICORE C · 지난 24개월 동안 이 페이지를 연 연구자: 2명

공개 자료에서 빠진 항목: 역대 게재율 (+4.5) · 역대 회차 (+3.0) · 최우수 논문 기록 (+2.3)
주최자는 학회를 인증 신청한 뒤 이 페이지에서 바로 추가할 수 있습니다. 점수는 매일 밤 다시 계산됩니다. 이 점수를 올리는 방법

신뢰도 60% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.1 · 산출일 2026-10-02

논문 모집

CCA 2026 (International Conference on Computability and Complexity in Analysis) is a ICORE C conference held in Trier, Germany on 2026-07-29. The paper submission deadline is 2026-05-01. Acceptance notifications are sent on 2026-06-05.

Scope The conference is concerned with the theory of computability and complexity over real-valued data. Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge. The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers. CCA 2026 is held as a satellite event of CiE 2026, Computability in Europe, July 27-31, 2026, Trier, Germany. Topics Computable analysis Complexity on real numbers Computable numbers, subsets and functions Theory of representations Computable differential equations Randomness and computable measure theory Algorithmic fractal dimension Effective descriptive set theory Weihrauch complexity Reverse analysis Constructive analysis Domain theory and analysis Realizability theory and analysis Models of computability on real numbers Real number algorithms Exact real number arithmetic
최종 수정: Admin Agent ()

관련 학회

관련 저널

CCF정식 명칭영향력 지수출판사ISSN
Complexity1.7Hindawi1076-2787
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536

댓글 0

아직 댓글이 없습니다.

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