Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Leonard Berman"'
Autor:
Leonard Berman
Publikováno v:
The Journal of Computational Finance. 1:79-95
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f67c7bce9da943443e4941a867d6289
https://doi.org/10.21314/jcf.1997.007
https://doi.org/10.21314/jcf.1997.007
Autor:
C. Leonard Berman
Publikováno v:
SIAM Journal on Scientific Computing. 16:1082-1091
We describe new high-order, momentum conserving methods for spreading charge to and interpolating potential from the mesh. These methods permit efficient grid-based algorithms to be used in high-order accurate n-body particle codes such as the fast m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb520aa71c6693a5270148c54f03402d
https://doi.org/10.1137/0916062
https://doi.org/10.1137/0916062
Autor:
C. Leonard Berman, Leslie Greengard
Publikováno v:
Journal of Mathematical Physics. 35:6036-6048
A number of problems in solid state physics and materials science can be resolved by the evaluation of certain lattice sums (sums over all sites of an infinite perfect lattice of some potential energy function). One classical example, the calculation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1d98289ea5eae233ca6ac0d6b91475d
https://doi.org/10.1063/1.530726
https://doi.org/10.1063/1.530726
Autor:
John Hayes, Harrison W. Farber, Maria M. Opris, Stanton C. Kessler, Eugen Bogdan Petcu, Leonard Berman, Valentin Gheorghiu
Publikováno v:
ResearcherID
Pulmonary arterial hypertension (PAH) is a well recognized, albeit uncommon, complication of systemic lupus erythematosus (SLE) and is characterized histologically by the presence of onionskin thickening of small arterioles. We described a 24 year-ol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c11bc8ddc9f6cb32ceff35de88ad5e4
https://doi.org/10.4323/rjlm.2009.83
https://doi.org/10.4323/rjlm.2009.83
Autor:
Murthy V. Devarakonda, Jay Unger, Inderpal Narang, Matt Haynos, Ying Li, Dinesh C. Verma, Jean-Pierre Prost, Leonard Berman, Rong N. Chang, Wen-Syan Li
Grid computing, in the commercial space, builds upon a set of management disciplines, which aims at mapping available resource capabilities to application workloads, according to requirements these workloads depend upon and to business goals they mus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::697e40773b61f207fdf49d3443e4b544
https://doi.org/10.1016/s0927-5452(05)80019-x
https://doi.org/10.1016/s0927-5452(05)80019-x
Autor:
Leonard Berman
Publikováno v:
SSRN Electronic Journal.
Monte Carlo simulations based on quasi-random Sobol sequences and pseudo-random numbers are compared with and without a stratified sampling variance reduction procedure (VR). We find that Sobol sequences are superior to pseudo-random without VR and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::440619bcb67f8fd9acddc9d09d06f1d3
https://doi.org/10.2139/ssrn.661
https://doi.org/10.2139/ssrn.661
Autor:
Leonard Berman, Juris Hartmanis
Publikováno v:
Journal of Computer and System Sciences. 16(3):418-422
In this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory, and EXTAPE complete sets arising from algebraic word problems are polynomial time isomorphic to the previousl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f26917e142a5798df064203c535ece43
Publikováno v:
IBM Journal of Research and Development. 25:272-280
A logic designer today faces a growing number of design requirements and technology restrictions, brought about by increases in circuit density and processor complexity. At the same time, the cost of engineering changes has made the correctness of ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80bdee7e5e1e371e6a38aee71c57ab95
https://doi.org/10.1147/rd.254.0272
https://doi.org/10.1147/rd.254.0272
Autor:
Leonard Berman, Juris Hartmanis
Publikováno v:
STOC
If all $NP$ complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then $P \ne NP$ and if all PTAPE complete sets are P-isomorphic then $P \ne {\text{PTAPE}}$. We show that all $NP$ complete sets known (in the litera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bc2f8a0bec30250b4837e403a0bca38
https://doi.org/10.1137/0206023
https://doi.org/10.1137/0206023
Publikováno v:
Information Processing Letters. 25:1-9
We make some observations concerning alternating Turing machines operating in small space. For example, we show that alternating Turing machines using o(log n) space are more powerful than nondeterministic Turing machines using the same space-bound.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63cb77dd488529a7f970c98198b51ff5
https://doi.org/10.1016/0020-0190(87)90085-8
https://doi.org/10.1016/0020-0190(87)90085-8