Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Steven Rudich"'
Autor:
Steven Rudich, Avi Wigderson
Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between diffe
Autor:
Ke Yang, Steven Rudich, Boaz Barak, Russell Impagliazzo, Oded Goldreich, Amit Sahai, Salil Vadhan
Publikováno v:
Journal of the ACM. 59:1-48
Informally, an obfuscator O is an (efficient, probabilistic) “compiler” that takes as input a program (or circuit) P and produces a new program O ( P ) that has the same functionality as P yet is “unintelligible” in some sense. Obfuscators, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f18285ec066a4c4818327ea52c48b7a1
https://doi.org/10.1145/2160158.2160159
https://doi.org/10.1145/2160158.2160159
Publikováno v:
Scopus-Elsevier
FOCS
FOCS
Karchmer, Raz, and Wigderson (1995) discuss the circuit depth complexity of n-bit Boolean functions constructed by composing up to d = log n/log log n levels of k = log n-bit Boolean functions. Any such function is in AC1 . They conjecture that circu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d5c1a7baf92495a7a15b9087bd37de8
https://doi.org/10.1007/s00037-001-8195-x
https://doi.org/10.1007/s00037-001-8195-x
Publikováno v:
STOC
We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal et al. (1998). In that paper, it was shown that all sets that are complete under (non-uniform) AC0 reductions are isomorphic under isomorphisms compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28f245625bf08544263a01769b361c52
https://doi.org/10.1007/s00037-001-8191-1
https://doi.org/10.1007/s00037-001-8191-1
Publikováno v:
FOCS
We investigate two problems concerning the complexity of evaluating a function f on k distinct inputs by k parallel decision-tree algorithms. In the product problem, for some fixed depth bound d, we seek to maximize the fraction of input k-tuples for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b6ebf0191926cc9dd6a022862a83b33
https://doi.org/10.1137/s0097539795282444
https://doi.org/10.1137/s0097539795282444
Publikováno v:
SIAM Journal on Computing. 25:1332-1357
We study a new problem---the wakeup problem---that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader-election problem, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0d04e104178d5fb94b32e8424274736
https://doi.org/10.1137/s0097539793254959
https://doi.org/10.1137/s0097539793254959
Publikováno v:
ACM SIGACT News. 27:3-7
This is the final part of a 2-part column on the future of computational complexity theory. The grounds rules were that the contributors had no restrictions (except a 1-page limit). For readers interested in more formal reports, in addition to the tw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c5cfb33b022dc8cdb854031c5533fc0
https://doi.org/10.1145/242581.242582
https://doi.org/10.1145/242581.242582
Publikováno v:
Computational Complexity. 4:367-382
Define the MOD m -degree of a boolean functionF to be the smallest degree of any polynomialP, over the ring of integers modulom, such that for all 0–1 assignments $$\vec x$$ , $$F(\vec x) = 0$$ iff $$P(\vec x) = 0$$ . We obtain the unexpected resul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be11f72c755cd162e021fc79f48c718f
https://doi.org/10.1007/bf01263424
https://doi.org/10.1007/bf01263424
Autor:
Linda, Sher, Linda, Jennings, Steven, Rudich, Sophoclis P, Alexopoulos, George, Netto, Lewis, Teperman, Milan, Kinkhabwala, Robert S, Brown, Elizabeth, Pomfret, Goran, Klintmalm
Publikováno v:
Clinical transplantation. 26(3)
Chronic hepatitis C virus (HCV) is the most common disease indication for liver transplantation (LT). Outcomes are compromised by near universal recurrence of HCV. A prospective multi-center randomized study to evaluate immunosuppressive strategies i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::d9b01ef8a303dcd556ec9242ae3b1992
https://pubmed.ncbi.nlm.nih.gov/22151078
https://pubmed.ncbi.nlm.nih.gov/22151078
Publikováno v:
Progress in transplantation (Aliso Viejo, Calif.). 20(4)
Context Tacrolimus is an immunosuppressant that undergoes therapeutic drug monitoring. The laboratory at our institution changed its immunoassay techniques from the fluorescence polarization immunoassay to the cloned enzyme donation immunoassay. Obje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7af3c2503b696210f92161bd8b524e53
https://pubmed.ncbi.nlm.nih.gov/21265288
https://pubmed.ncbi.nlm.nih.gov/21265288