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

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

  • Authors :

Subjects: Expander mixing lemmaPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566 ; MFCS

Record details

×
Conference

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

  • Authors :

Subjects: Expander mixing lemmaPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566 ; MFCS

Record details

×
Conference

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

  • Authors :

Subjects: Expander mixing lemmaPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02558566 ; MFCS

Record details

×
Conference

Reducing Graph Transversals via Edge Contractions

  • Authors :

Subjects: blocker problemPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991812 ; MFCS

Record details

×
Conference

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps

  • Authors :

Subjects: Parameterized complexityPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991855 ; MFCS

Record details

×
Conference

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

  • Authors :

Subjects: parameterized complexityPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991913 ; MFCS

Record details

×
Conference

Hierarchical Clusterings of Unweighted Graphs

  • Authors :

Subjects: Hierarchical ClusteringPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-03027532 ; MFCS

Record details

×
Conference

Reducing Graph Transversals via Edge Contractions

  • Authors :

Subjects: blocker problemPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991812 ; MFCS

Record details

×
Conference

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps

  • Authors :

Subjects: Parameterized complexityPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991855 ; MFCS

Record details

×
Conference

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

  • Authors :

Subjects: parameterized complexityPrague

  • Source: MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991913 ; MFCS

Record details

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