Publication

Collisional energy transfer in the reactions I + NO + M -> INO + M and I + NO2 + M -> INO2 + M

Hubert van den Bergh
1977
Journal Articles

Abstract

The low-pressure recombination rate consts. of the reactions I + NO + M -> INO + M (with 14 different M) and I + NO2 + M -> INO2 + M (with 26 different M) were measured at 330 K by laser flash photolysis. The collision efficiencies bc are analyzed and compared with other thermal activation systems. Whereas bc increases in 1 reaction with an increasing no. of atoms in M, practically no such effect is found when, for the same M, different reactions with varying complexities of the reacting mols. are considered.

Official source

https://infoscience.epfl.ch/entities/publication/f78055bb-6243-4b96-99de-fcc1429906f8

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Hubert van den Bergh
1977
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/f78055bb-6243-4b96-99de-fcc1429906f8

About this result

Related concepts (24)

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related publications (5)

Collisional energy transfer in the reactions I + NO + M -> INO + M and I + NO2 + M -> INO2 + M

Chat with Graph Search

Symmetry-Aware Bayesian Optimization via Max Kernels

Learning-agent-based Approach to the Characterization of Open Quantum Systems

Complexity of linear relaxations in integer programming