技能创建器
skill-creator
创建、改进和评估自定义技能,把专业流程转化为可重复使用的 AI 能力。
focs-topic-selection【数据与研究】Use when deciding whether a theoretical-computer-science result belongs at FOCS (IEEE Symposium on Foundations of Computer Science) — testing foundations-level significance, weighing the April deadline against sibling theory venues like STOC, SODA, CCC, ITCS, or CRYPTO, and applying the CFP's broaden-the-reach clause.
独立 GitHub 快照 · 自动分类 · 以原作者文档为准
FOCS asks for "new and original research on theory of computation" and explicitly
welcomes papers that broaden the reach of the theory of computing or raise
important problems that can benefit from theoretical investigation (FOCS 2026
CFP, checked 2026-07-08 via focs.computer.org/2026/call-for-papers-2/). The
selection question is therefore two-dimensional: is this a theorems paper whose
significance survives a committee drawn from every corner of TCS, and is the
April-anchored IEEE cycle the right launch window for it?
A foundations flagship rewards results that change what other theoreticians can prove, not results that only optimize inside one subcommunity's parameter chart. Before committing to the April deadline, answer three questions in writing:
A "yes" on two of three is competitive; a "yes" driven only by technical difficulty, with no consequence statement, is the classic strong-reject-with- respect outcome.
| Signal in your result | Better home | Why |
|---|---|---|
| General TCS interest, mature proofs, ready by April 1 | FOCS | The fall flagship; full-version submissions welcome |
| Same profile, but ready in autumn | STOC (ACM SIGACT) | The spring flagship; the other beat of the same community |
| Algorithms with heavy implementation or fine-grained constants | SODA / ESA | Committees calibrated for algorithmic depth over breadth |
| Complexity-internal progress (e.g., inside a known hierarchy) | CCC | Specialist referees who value the regime you improved |
| Conceptual model or provocative definition, proofs still thin | ITCS | Explicitly rewards vision over completeness |
| Cryptographic construction with security-proof machinery | CRYPTO / EUROCRYPT / TCC | IACR reviewing conventions fit the proof style |
| Quantum result addressed mainly to quantum insiders | QIP | Talk-driven venue; pair with an arXiv record |
| Learning-theoretic core with sample-complexity focus | COLT / ALT | Statistical-learning referees |
| Geometry- or distributed-computing-native contribution | SoCG / PODC / DISC | Community-specific evaluation depth |
FOCS and STOC differ in sponsor (IEEE Computer Society TCMF vs. ACM SIGACT), calendar seat, and program committee — not in scope or prestige. Never argue "FOCS because it is stronger than X"; argue from audience and timing.
The FOCS deadline (April 1 for the 2026 cycle) sits roughly five months after STOC's early-November deadline and about seven months before the conference itself. Consequences worth planning around:
The CFP sentence inviting papers that widen theory's reach is a real lane, not decoration: FOCS regularly accepts work importing TCS rigor into new territory (economic mechanisms, learning pipelines, quantum experiments, fairness, verification). To use the lane safely:
focs-experiments for what
computation can and cannot do in this venue.[Claimed contribution] <one sentence, no adjectives>
[Consequence outside subarea] <named problem or belief revised — or NONE>
[Barrier bypassed] <named obstacle — or NONE>
[Deletion test] remove best constants: still citable? yes/no
[Cycle fit] proofs complete by April 1? yes/no
[Verdict] FOCS / STOC (autumn) / specialized venue: ____
Two NONE answers or a "no" on proof completeness means route elsewhere or wait
a beat. FOCS grants no rebuttal in which to repair a shaky significance case
(see focs-review-process), so the routing decision must be honest before the
formatting work begins. If the contribution is a new model or problem rather
than a theorem, re-read the CFP's broaden-the-reach sentence and consider
whether ITCS's explicitly conceptual charter serves the paper better — an
important-problems paper at FOCS still needs nontrivial technical evidence
that the problem is tractable and rich.
Finally, calibrate against the venue's own memory: the exemplars library in
resources/exemplars/library.md maps recent Test of Time and Machtey Award
citations to durability patterns (field-opener, technique transplant,
barrier map, subfield founder). If your draft cannot honestly claim kinship
with any pattern there, that is not disqualifying — but it predicts which
committee question (focs-review-process) will decide your fate, and it
should shape where the writing effort goes.