Gesamter Bestand

Auflistung Nach Schlagwort "Polynomial-time"

Anzeige der Dokumente 1-4 von 4

    • Different speeds suffice for rendezvous of two agents on arbitrary graphs 

      Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017)
      We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse ...

    • Exclusive graph searching vs. pathwidth 

      Markou E., Nisse N., Pérennes S. (2017)
      In Graph Searching, a team of searchers aims at capturing an invisible fugitive moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a contaminated network. The problem is to compute the minimum ...

    • A Fast Timing Separation of Events Algorithm for Concurrent Systems 

      Aimoniotis P., Xiromeritis N., Sotiriou C. (2019)
      In this work, we present a fast, polynomial time implementation of the Timing Separation of Events (TSE) Algorithm, with complexity O(E × (V+E). TSE computation is a fundamental problem in the analysis of event-driven, ...

    • Implementation of Shor's Algorithm and Reliability of Quantum Computing Devices 

      Sabani M., Galanis I., Savvas I., Garani G. (2021)
      The process to find the prime factors of a large number, the "factoring problem"is believed to be a very hard problem. For this reason, it is the cornerstone of modern cryptographic schemes, like RSA cryptosystem. In 1994, ...