Results 301 to 310 of about 22,742,041 (354)
Some of the next articles are maybe not open access.

Snarks and reducibility

Ars Comb., 1998
A snark is a simple, cyclically 4-edge connected cubic graph with girth at least 5 and chromatic index 4. A cubic graph \(G\) is vertex-reducible to a simple cubic graph \(G'\) if \(G'\) can be obtained from \(G\) by removing two vertices together with all incident edges from \(G\) and adding new edges to obtain \(G'\).
Gunnar Brinkmann, Eckhard Steffen
openaire   +2 more sources

Leptin levels in human and rodent: Measurement of plasma leptin and ob RNA in obese and weight-reduced subjects

Nature Medicine, 1995
M. Maffei   +11 more
semanticscholar   +1 more source

Tools for Reduced Precision Computation

ACM Computing Surveys, 2021
Giovanni Agosta, Stefano Chérubin
exaly  

To reduce or not to reduce?

Emergency Medicine Journal
Vikram Kishor Kandhari   +2 more
openaire   +2 more sources

Reduced order and surrogate models for gravitational waves

Living Reviews in Relativity, 2022
Aaron Villanueva, Manuel Tiglio
exaly  

Home - About - Disclaimer - Privacy