Results 261 to 270 of about 1,745,964 (294)

Stringent selection on kinetics of condensation reactions: early steps in chemical evolution.

Phys Chem Chem Phys
Capera-Aragones P, Matange K, Rajaei V, Pinter Y, Petrov AS, Williams LD, Frenkel-Pinter M.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Conundrum of combinatorial complexity

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
This paper examines fundamental problems underlying difficulties encountered by pattern recognition algorithms, neural networks, and rule systems. These problems are manifested as combinatorial complexity of algorithms, of their computational or training requirements.
L I Perlovsky
exaly   +2 more sources

A combinatorial approach to complexity

Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavel Pudlák, Vojtech Rödl
openaire   +2 more sources

The combinatorial complexity of masterkeying

Mathematical Methods of Operations Research (ZOR), 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wolfgang Espelage, Egon Wanke
openaire   +1 more source

Complexity of Combinatorial Algorithms

SIAM Review, 1978
This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results. Included are sections discussing ways to measure the complexity of an algorithm, methods for proving that certain problems are very hard to solve, tools useful in the design of good ...
openaire   +2 more sources

On the Computational Complexity of Combinatorial Problems

Networks, 1975
A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time.
openaire   +3 more sources

The combinatorial complexity of hyperplane transversals

Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990
We show that the maximum combinatorial complexity of the space of hyperplane transversals to a family of n separated and strictly convex sets in Rd is T(n⌊d/2⌋), which generalizes results of Edelsbrunner and Sharir in the plane. As a key step in the argument, we show that the space of hyperplanes tangent to k ≤ d separated and strictly convex sets in ...
Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger   +5 more
openaire   +1 more source

The combinatorial complexity of a finite string

1994
A function, B(x) is introduced which assigns a real number to a string, x, which is intended to be a measure of the randomness of x. Comparisons are made between B(x) and K(x), the Kolmogorov complexity of x. A O(n3) algorithm for computing B(x) is given, along with brief descriptions of experimental results showing the efficacy of this function in ...
Felix Frayman, Valery Kanevsky, Walter W. Kirchherr   +2 more
openaire   +2 more sources

On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM, 1996
In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the
Saugata Basu, Richard Pollack, Marie-Françoise Roy   +2 more
openaire   +3 more sources

Combinatorial Complexity of Regular Languages

2008
We study combinatorial complexity (or counting function) of regular languages, describing these functions in three ways. First, we classify all possible asymptotically tight upper bounds of these functions up to a multiplicative constant, relating each particular bound to certain parameters of recognizing automata.
openaire   +2 more sources