Zobrazeno 1 - 10
of 14
pro vyhledávání: '"A. J. W. Duijvestijn"'
Autor:
A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 65:1289-1293
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fdf2d1f484a64bf506b5162329b25d1
https://doi.org/10.1090/s0025-5718-96-00749-1
https://doi.org/10.1090/s0025-5718-96-00749-1
Autor:
B. Helthuis, A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 54:749-753
A table of 4and 5-hedra of orders up to and including 22 is given. In 1981 we reported on the number of polyhedral graphs [5]. That work was a byproduct of the search for the lowest-order squared square, which was found in March 1978 [3]. The squarin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76b7f7255c5464a5213576594aa90e71
https://doi.org/10.1090/s0025-5718-1990-1011441-8
https://doi.org/10.1090/s0025-5718-1990-1011441-8
Autor:
A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 62:325
In this note tables of all simple perfect squared squares and simple 2x1 perfect squared rectangles of order 25 are presented.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a12e612ce30dfd18ecbb758eea5ab6e1
https://doi.org/10.2307/2153412
https://doi.org/10.2307/2153412
Autor:
A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation; 1996, Vol. 65 Issue 215, p1359-1364, 6p
Publikováno v:
The American Mathematical Monthly. 89:15-32
(1982). Compound Perfect Squares. The American Mathematical Monthly: Vol. 89, No. 1, pp. 15-32.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10cd20092744f4993382e23b6714485d
https://doi.org/10.1080/00029890.1982.11995375
https://doi.org/10.1080/00029890.1982.11995375
Publikováno v:
Information systems, 10(3), 325-330. Elsevier
A select operation that is part of an expression applying to a relational database is decomposed into one or more independent select operations for the purpose of optimising the relational expression. The select expression is treated as a logical exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6203ceb6afb536073b77a44abe90894f
https://doi.org/10.1016/0306-4379(85)90025-0
https://doi.org/10.1016/0306-4379(85)90025-0
Publikováno v:
IBM Journal of Research and Development. 27:497-519
An expression applying to a relational database is optimized by mapping the expression upon set expressions which, in turn, are transformed into logical expressions. These logical expressions then are optimized, taking into account the constraints th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43b7a1ac4772c25eabbee731c8231ebe
https://doi.org/10.1147/rd.275.0497
https://doi.org/10.1147/rd.275.0497
On the Transition from Superconducting to Normal Phase, Accounting for Latent Heat and Eddy Currents
Autor:
A. J. W. Duijvestijn
Publikováno v:
IBM Journal of Research and Development. 3:132-139
A rigorous solution is given for the superconducting transition of a semi-infinite slab held at a point below the critical temperature Tc, when a constant magnetic field above the critical value Hoc, is applied. The solution accounts for both the abs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a1ffb3f2b6ddc17b10ad7b09d5bc55b
https://doi.org/10.1147/rd.32.0132
https://doi.org/10.1147/rd.32.0132
Autor:
A. J. W. Duijvestijn, P. J. Federico
Publikováno v:
Mathematics of computation, 37(156), 523-532. American Mathematical Society
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 22 edges. The numbers of such graphs having the same number of edges, and the same number of vertices and faces, are tabulated. Con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ca2a1846a4b8c9160292ac732e9aae9
https://doi.org/10.2307/2007444
https://doi.org/10.2307/2007444
Publikováno v:
Mathematics of Computation. 15:315
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2a079f9df8db4ce414f2e13fe7245b1
https://doi.org/10.2307/2002933
https://doi.org/10.2307/2002933