logo
科言猫学术研究的AI总结
language
手机端手机端
  • Phone Feature微信小程序
简体中文简体中文
notice消息通知
博客博客
delete
arrow
返回期刊详情
F

FUNDAMENTALS OF COMPUTATION THEORY, FCT 2025

IF
论文数30
被引数
期刊论文 30
发表时间
delete
Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3平面图中最大度数为3的唯一最小顶点覆盖预分配问题的难度
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteHoriyama, Takashi; Sakamoto, Fumiya; Seto, Kazuhisa; Suzuki, Ryu
delete分享
delete收藏
On Saving Energy in Boolean Circuits via Negations通过否定操作在布尔电路中节能
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteSarma, Jayalal; Uchizawa, Kei
delete分享
delete收藏
Shallow-Rotation Distance via Forest Representations基于森林表示的浅层旋转距离
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteAnoop, S. K. M.; Sarma, Jayalal
delete分享
delete收藏
Red-Blue Unshared Dominators红-蓝非共享支配集
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteCordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A.
delete分享
delete收藏
Determining the Metric Dimension of Ka x Kb x Kc by Static Black-Peg Mastermind通过静态黑钉主mind游戏确定Ka x Kb x Kc的度量维度
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteGledel, Valentin; Jager, Gerold
delete分享
delete收藏
On the Complexity of Problems on Graphs Defined on Groups关于在群上定义的图的问题的复杂性
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteDas, Bireswar; Dey, Dipan; Ghosh, Jinia
delete分享
delete收藏
Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs感应追踪与在DAG中寻找哈密顿路径的复杂性
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteBhadra, Ronak; Tewari, Raghunath
delete分享
delete收藏
A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank研究具有小常数实秩的矩阵的二进制和布尔秩
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteParnas, Michal; Shraibman, Adi
delete分享
delete收藏
Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs在块图和仙人掌图上的彩色3-彩虹支配的线性时间算法
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteLavynska, Tetiana
delete分享
delete收藏
Disjointness, Inclusion, and Regularity of ω-Rational Trace Languages - Extended Abstract -ω-有理迹语言的互斥性、包含性与正则性 - 扩展摘要 -
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteKuske, Dietrich
delete分享
delete收藏
On the Parameterized Complexity of Cosecure Domination关于协同安全支配的参数化复杂性
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteKarthika, D.; Muthucumaraswamy, R.; Abidha, V. P.; Ashok, Pradeesha; Bhyravarapu, Sriram; Das, Sayani; Saurabh, Saket; Sawlani, Ayush; Tripathi, Vikash
delete分享
delete收藏
Simultaneous Contact Representations of Planar Graphs平面图的同时接触表示
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteKratochvil, Jan; Reihl, Melanie
delete分享
delete收藏
Cyclic Equalizability of Words and Its Application to Card-Based Cryptography单词的循环等价性及其在基于卡片的密码学中的应用
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteShinagawa, Kazumasa; Nuida, Koji
delete分享
delete收藏
On Complementation of Nondeterministic Finite Automata Without Full Determinization关于非确定性有限自动机互补运算无需完全确定化的研究
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteHolik, Lukas; Lengal, Ondrej; Major, Juraj; Stepkova, Adela; Strejcek, Jan
delete分享
delete收藏
Tight Bounds for the Number of Absent Subsequences缺席子序列数量的紧界
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteAdamson, Duncan; Fleischmann, Pamela; Huch, Annika; Manea, Florin; Sarnighausen-Cahn, Paul; Wiedenhoeft, Max
delete分享
delete收藏
Parameterized Restless Temporal Path参数化无休止时序路径
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteCauvi, Justine; Viennot, Laurent
delete分享
delete收藏
On the Parameterized Complexity of Connected Cluster Vertex Deletion关于参数化复杂性中连通簇顶点删除的问题
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteAbhinav, Ankit; Bhyravarapu, Sriram; Mohanapriya, A.; Saurabh, Saket
delete分享
delete收藏
Complexity of Identifying Fitting-Free Groups识别无需拟合群的复杂性
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteGrochow, Joshua A.; Johnson, Dan; Levet, Michael
delete分享
delete收藏
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphsm-永恒支配及其在有限图和无限图某些类上的变体
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteCalamoneri, Tiziana; Coro, Federico; Misra, Neeldhara; Nanoti, Saraswati Girish; Paesani, Giacomo
delete分享
delete收藏
Combinatorics of Palindromes回文组合学
deleteFUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF0
delete2026-01-01
delete0
PREAI
deleteItzhaki, Michael
delete分享
delete收藏