Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Any view
  • Any view
  • Preview and full view
  • Full view
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... proof-of-work (2013) 33. Lihu, A., Du, J., Barjaktarevic, I., Gerzanics, P., Harvilla, M.: A proof of useful work for artificial intelligence on the blockchain. arXiv:2001.09244 preprint (2020) 34. Loe, A.F., Quaglia, E.A.: Conquering ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... complete problem based on the results of other pools. Usually, it appears at the time out of block hash value search ... NP-complete problem such as proof of prestige [47], proof of useful work [7]. Werner et al. [78] discussed the ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... NP- hard and NP - hard to approximate over general graphs . Notice that , in our con- text , dependency graphs are all oriented graphs . We prove that DIRECTEDBAND- WIDTH remains NP - hard and NP - hard to approximate within any ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... conquer algorithms. It is NP-hard in general [5] and the best approximation algorithm known [9] guarantees an approximation ratio of O(logn). For planar graphs a PTAS [2] has been found, while for trees an optimum solution can be ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... work . lists of the Music Trade would long since have got the price of Music up to 5s , a sheet . - Messrs . Walker ... N. P. WILLIS'S NEW WORK . In 3 vols . royal 12mo . 31s . 6d . boards , BY THE 2nd edition . PENCILLINGS WAY . A ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... useful in practice [4,10,28], as the constant factors, even for small values of k, are much too large. Thus, there ... work has been done on finding tree decompositions in practical settings (see e.g., the overviews in [7,9]) ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... proof strategies such as loop variants and induction which are commonly used. The second topic we investigated was NP-completeness. We classified problems as the ones in P, in NP, and the problems that are NP-hard ... work with a wide ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... work which will probably stagger in many points even the most inveterate ... hard Meyer has completed his literary lexicon ; and Otto Sjögren continued ... proof of his zeal in literary re- searches ; and Johannes Sundblad's ...
Conquering Generals: an NP-Hard Proof of Useful Work. from books.google.com
... WORKS OF THE SEASON . Mr. M'CRONE has this day published , ENCILLINGS BY THE WAY . By N. P. WILLIS , Esq . 3 vols . post 8vo . M Y PEN II . NOTEBOOK . By the Author of British America . ' 3 vols . post 8vo . III . OLD BACHELORS . By the ...