“Invention Is Hard, but Dissemination Is Even Harder”
نویسندگان
چکیده
منابع مشابه
Detecting communities is Hard (And Counting Them is Even Harder)
We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph G = (V, E), a subset S ⊆ V is an (α, β)-community if: • Every member of the community is friends with an α-fraction of the community; • Every non-member is friends with at most a β-fraction of the community. Arora et al [AGSS12] gave a quasi-polynomial time algorithm for enumerating all ...
متن کاملHonest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder
We prove that, assuming the exponential time hypothesis, finding an ǫ-approximately optimal symmetric signaling scheme in a two-player zero-sum game requires quasi-polynomial time (n). This is tight by [6] and resolves an open question of Dughmi [10]. We also prove that finding a multiplicative approximation is NP-hard.
متن کاملTetris is Hard, Even to Approximate
Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are fill...
متن کاملBreaking up is hard to do: why disinvestment in medical technology is harder than investment.
Healthcare technology is a two-edged sword - it offers new and better treatment to a wider range of people and, at the same time, is a major driver of increasing costs in health systems. Many countries have developed sophisticated systems of health technology assessment (HTA) to inform decisions about new investments in new healthcare interventions. In this paper, we question whether HTA is als...
متن کاملct 2 00 2 Tetris is Hard , Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Therapy
سال: 2005
ISSN: 0031-9023,1538-6724
DOI: 10.1093/ptj/85.5.390