Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Conference

How did they design this game? Swish: complexity and unplayable positions

  • Authors :

Subjects: GameSardiniaIsland of La Maddalena, Sardinia, Italy, Italy

  • Source: 12th International Conference on Fun with Algorithms (FUN 2024)https://hal.science/hal-0448923812th International Conference on Fun with Algorithms (FUN 2024), Jun 2024, Island of La

Record details

×
Conference

Isometric Path Complexity of Graphs

  • Authors :

Subjects: Shortest pathsBordeaux

  • Source: Leibniz International Proceedings in Informatics ; 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) ; https://hal.science/hal-04184516 ; 48th International

Record details

×
Conference

Isometric Path Complexity of Graphs

  • Authors :

Subjects: Shortest pathsBordeaux

  • Source: Leibniz International Proceedings in Informatics ; 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) ; https://hal.science/hal-04184516 ; 48th International

Record details

×
Conference

Realizing finitely presented groups as projective fundamental groups of SFTs

  • Authors :

Subjects: Theory of computation → Models of computationBordeaux

  • Source: Leibniz International Proceedings in Informatics (LIPIcs) ; Mathematical Foundations of Computer Science (MFCS) ; https://hal.science/hal-03622497 ; Mathematical Foundations of Computer Science

Record details

×
Conference

Isometric Path Complexity of Graphs

  • Authors :

Subjects: Shortest pathsBordeaux

  • Source: Leibniz International Proceedings in Informatics ; 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) ; https://hal.science/hal-04184516 ; 48th International

Record details

×
Conference

Isometric Path Complexity of Graphs

  • Authors :

Subjects: Shortest pathsBordeaux

  • Source: Leibniz International Proceedings in Informatics ; 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) ; https://hal.science/hal-04184516 ; 48th International

Record details

×
Conference

Realizing finitely presented groups as projective fundamental groups of SFTs

  • Authors :

Subjects: Theory of computation → Models of computationBordeaux

  • Source: Leibniz International Proceedings in Informatics (LIPIcs) ; Mathematical Foundations of Computer Science (MFCS) ; https://hal.science/hal-03622497 ; Mathematical Foundations of Computer Science

Record details

×
Conference

Isometric Path Complexity of Graphs

  • Authors :

Subjects: Shortest pathsBordeaux

  • Source: Leibniz International Proceedings in Informatics ; 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) ; https://hal.science/hal-04184516 ; 48th International

Record details

×
Conference

Sample Compression Schemes for Balls in Graphs

  • Authors :

Subjects: Graph algorithmsVienna

  • Source: MFCS 2022 -- 47th International Symposium on Mathematical Foundations of Computer Science ; https://hal.science/hal-03854487 ; MFCS 2022 -- 47th International Symposium on Mathematical Foundations of

Record details

×
Conference

Sample Compression Schemes for Balls in Graphs

  • Authors :

Subjects: Graph algorithmsVienna

  • Source: MFCS 2022 -- 47th International Symposium on Mathematical Foundations of Computer Science ; https://hal.science/hal-03854487 ; MFCS 2022 -- 47th International Symposium on Mathematical Foundations of

Record details

×
  • 1-10 of  14 results for ""Mathematics""