Results 71 to 80 of about 55,873 (316)
Proof Compression and NP Versus PSPACE II: Addendum
In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
In this paper, the first use of a siloxane‐substituted silicon phthalocyanine (iso(Si3O)2SiPc) in OTFTs is reported. Moreover, this compound displays the highest hole mobility (exceeding 1 cm2 V−1 s−1) ever recorded for SiPc, and the GIWAXS study reveals thin films with an exceptionally uniform crystalline texture.
Nicolas Ledos +5 more
wiley +1 more source
Polymer‐based drug delivery systems can effectively overcome the limitations of free drugs in terms of solubility, stability, and plasma half‐life, yet their development has traditionally relied on time‐consuming trial‐and‐error approaches. This review highlights recent advances in applying molecular simulation to the design of polymer‐based drug ...
Ping Gao +4 more
wiley +1 more source
The Solution of the Extended 16th Hilbert Problem for Some Classes of Piecewise Differential Systems
The limit cycles have a main role in understanding the dynamics of planar differential systems, but their study is generally challenging. In the last few years, there has been a growing interest in researching the limit cycles of certain classes of ...
Louiza Baymout +2 more
doaj +1 more source
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
On the number of Hamiltonian cycles in tournaments
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at least exponentially with the minimum outdegree of ...
openaire +3 more sources
Li‐Well ZnO Memtransistors: High Reliability for Neuromorphic Applications
A novel lithium (Li)‐well ZnO memtransistor integrates transistor switching and nonvolatile memory, akin to ferroelectric field‐effect transistors (FeFETs) and floating gates, while enabling low‐power operation via Li⁺ ion migration. Li⁺ ion migration and switching mechanisms were confirmed by 3D secondary ion mass spectrometry (SIMS).
Ki‐Hoon Son +4 more
wiley +1 more source
Hamilton Cycles in Double Generalized Petersen Graphs
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduced the double generalized Petersen graphs (DGPGs). Kutnar and Petecki proved that DGPGs are Hamiltonian in special cases and conjectured that all DGPGs are
Sakamoto Yutaro
doaj +1 more source
Grafos hamiltonianos en el diseño de viajes
The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Graph ...
Christian Löwenstein +2 more
doaj +1 more source

