Results 1 to 10 of about 7,719 (91)
Self-reducibility structures and solutions of NP problemst [PDF]
Revista Matemática Complutense, 1989 Sin ...
Balcázar, José L.
openaire +4 more sources
Frontiers in Chemistry, 2021 Solid oxide fuel cell (SOFC) is an advanced electricity generation device with attractive fuel flexibility and conversion efficiency. As its reversed process, solid oxide electrolysis cell (SOEC) can efficiently electrolyze notorious CO2 to valuable ...
Zhishan Li +4 more
doaj +1 more source
Paradigms for Parameterized Enumeration [PDF]
, 2013 The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity.
D. Marx +7 more
core +2 more sources
Activity of alumina supported fe catalysts for N2O decomposition: Effects of the iron content and thermal treatment [PDF]
, 2017 Indexación: Scopus.The activity of Fe2O3/Al2O3 catalysts prepared by impregnation of Al2O3 with different amounts of Fe and calcination temperatures (650 and 900 °C) in the direct N2O decomposition reaction was studied.
Aguila, G. +4 more
core +1 more source
A Vector Matroid-Theoretic Approach in the Study of Structural Controllability Over F(z) [PDF]
, 2017 In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. Firstly, a vector matroid is defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived in terms of the concept
Chen, Ying +4 more
core +2 more sources
A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems [PDF]
, 2014 Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$ satisfies ...
Bhattacharyya A., Král' D.
core +1 more source
The prospects for mathematical logic in the twenty-first century [PDF]
, 2001 The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris +4 more
core +3 more sources
A weak characterization of slow variables in stochastic dynamical systems
, 2020 We present a novel characterization of slow variables for continuous Markov processes that provably preserve the slow timescales. These slow variables are known as reaction coordinates in molecular dynamical applications, where they play a key role in ...
A Bittracher +39 more
core +1 more source
Isogeny graphs of ordinary abelian varieties [PDF]
, 2016 Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties.
Brooks, Ernest Hunter +2 more
core +2 more sources
Complexity of equivalence relations and preorders from computability theory
, 2013 We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]
Ianovski, Egor +3 more
core +1 more source