نتائج البحث

Non-Clashing Teaching Maps for Balls in Graphs

• Authors : Chalopin, Jérémie; Chepoi, Victor; Inerney, Fionn Mc ...

Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)Edmonton (Alberta)Edmonton (Alberta), Canada

• Source: Proceedings of Machine Learning Research ; COLT 2024 -- 37th Annual Conference on Learning Theory ; https://hal.science/hal-04728693 ; COLT 2024 -- 37th Annual Conference on Learning Theory, 2024,

تفاصيل العنوان

On the binary and Boolean rank of regular matrices

• Authors : Haviv, Ishay; Parnas, Michal

Subjects: FOS: Computer and information sciences; Theory of computation → Communication complexity; Discrete Mathematics (cs.DM)

• Source: Journal of Computer and System Sciences. 134:73-86

تفاصيل العنوان

On the equivalence of two post-quantum cryptographic families

• Authors : Alessio Meneghetti; Alex Pellegrini; Massimiliano Sala ...

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Polynomial-time reductions

• Source: Annali di Matematica Pura ed Applicata, 202(2), 967-991. Springer

تفاصيل العنوان

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

• Authors : Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

• Source: Discrete Applied Mathematics. 322:117-122

تفاصيل العنوان

On the complexity of matching cut for graphs of bounded radius and H-free graphs

• Authors : Felicia Lucke; Daniël Paulusma; Bernard Ries

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

• Source: Theoretical computer science, 2022, Vol.936, pp.33-42 [Peer Reviewed Journal]

تفاصيل العنوان

Succinct navigational oracles for families of intersection graphs on a circle

• Authors : Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

• Source: Theoretical Computer Science. 928:151-166

تفاصيل العنوان

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations

• Authors : Foucaud, Florent; Galby, Esther; Khazaliya, Liana

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

تفاصيل العنوان

Minimum Separator Reconfiguration

• Authors : Gomes, Guilherme C. M.; Legrand-Duchesne, Clément; Mahmoud, Reem

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

تفاصيل العنوان

Packing squares independently

• Authors : Wu, Wei; Numaguchi, Hiroki; Hu, Yannan

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

تفاصيل العنوان

Parameterised distance to local irregularity

• Authors : Fioravantes, Foivos; Melissinos, Nikolaos; Triommatis, Theofilos

Subjects: FOS: Computer and information sciences; Computer Science - Computational Complexity; Discrete Mathematics (cs.DM)

تفاصيل العنوان