المؤلفون: Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

مصطلحات موضوعية: Computer Science - Computational Complexity, Mathematics - Combinatorics

الوصول الحر: http://arxiv.org/abs/2310.04391Test

المؤلفون: Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

المساهمون: V. Arvind and Frank Fuhlbrück and Johannes Köbler and Oleg Verbitsky

مصطلحات موضوعية: Graph Isomorphism, spectra of graphs, combinatorial refinement, strongly regular graphs

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024); urn:nbn:de:0030-drops-197166; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.6Test

الإتاحة: https://doi.org/10.4230/LIPIcs.STACS.2024.6Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-197166Test

المؤلفون: Fuhlbrück, Frank, Köbler, Johannes, Ponomarenko, Ilia, Verbitsky, Oleg

مصطلحات موضوعية: Mathematics - Combinatorics, Computer Science - Computational Complexity

الوصول الحر: http://arxiv.org/abs/2005.08887Test

المؤلفون: Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

مصطلحات موضوعية: Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, Mathematics - Combinatorics

الوصول الحر: http://arxiv.org/abs/2002.04590Test

المؤلفون: Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

مصطلحات موضوعية: Computer Science - Computational Complexity

الوصول الحر: http://arxiv.org/abs/1910.11325Test

المؤلفون: Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

مصطلحات موضوعية: Computer Science - Computational Complexity, Mathematics - Combinatorics

الوصول الحر: http://arxiv.org/abs/1907.02892Test

المؤلفون: Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

مصطلحات موضوعية: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Computer Science - Logic in Computer Science

الوصول الحر: http://arxiv.org/abs/1811.04801Test

المؤلفون: Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Kuhnert, Sebastian, Rattan, Gaurav

مصطلحات موضوعية: Computer Science - Computational Complexity, F.2.0

الوصول الحر: http://arxiv.org/abs/1606.04383Test

المؤلفون: Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

المساهمون: Frank Fuhlbrück and Johannes Köbler and Oleg Verbitsky

مصطلحات موضوعية: Graph Isomorphism, Weisfeiler-Leman Algorithm, Cai-Fürer-Immerman Graphs, coherent Configurations

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020); urn:nbn:de:0030-drops-119046; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.43Test

الإتاحة: https://doi.org/10.4230/LIPIcs.STACS.2020.43Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-119046Test

المؤلفون: Arvind, Vikraman, Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

المصدر: Language and Automata Theory and Applications ; Lecture Notes in Computer Science ; page 357-368 ; ISSN 0302-9743 1611-3349 ; ISBN 9783030406073 9783030406080

الإتاحة: https://doi.org/10.1007/978-3-030-40608-0_25Test