Results 161 to 170 of about 6,604,045 (304)

The Penrose Transform for Complex Projective Space [PDF]

open access: yesarXiv, 2008
Various complexes of differential operators are constructed on complex projective space via the Penrose transform, which also computes their cohomology.
arxiv  

Tight Coupling of Partial Reactions in the Acetyl-CoA Decarbonylase/Synthase (ACDS) Multienzyme Complex from Methanosarcina thermophila

open access: yesJournal of Biological Chemistry, 2010
Direct synthesis and cleavage of acetyl-CoA are carried out by the bifunctional CO dehydrogenase/acetyl-CoA synthase enzyme in anaerobic bacteria and by the acetyl-CoA decarbonylase/synthase (ACDS) multienzyme complex in Archaea.
S. Gencic, E. Duin, D. Grahame
semanticscholar   +1 more source

Five Questions on Complexity [PDF]

open access: yesarXiv, 2007
This introductory paper is structured in the form of an "interview", where the author answers the following questions: Why did you begin working with complex systems? How would you define complexity? What is your favourite aspect/concept of complexity? In your opinion, what is the most problematic aspect/concept of complexity? How do you see the future
arxiv  

Reset Complexity of Ideal Languages [PDF]

open access: yesarXiv, 2014
We present a new characteristic of a regular ideal language called reset complexity. We find some bounds on the reset complexity in terms of the state complexity of a given language. We also compare the reset complexity and the state complexity for languages related to slowly synchronizing automata and study uniqueness question for automata yielding ...
arxiv  

Investigations in space-related molecular biology, including considerations of the molecular organization of extraterrestrial matter Technical progress report [PDF]

open access: yes
Space related molecular biology and molecular organization of extraterrestrial matter - design and construction of high vacuum container for transfer of extraterrestrial collecting ...
Fernandez-Moran, H.
core   +1 more source

Conflict complexity is lower bounded by block sensitivity [PDF]

open access: yesarXiv, 2018
We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity.
arxiv  

Home - About - Disclaimer - Privacy