|... ideas, results, and references, for the
|Complexity Classes in Optimization
Complexity Classes in Optimization
Hunt, H. B., III
|... The first is that information-based
|INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION
INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION
Traub, J. F.; Werschulz, A. G.
|... field now generally known as Kolmogorov
|... differentiation; handcoded derivatives
|Complexity of Gradients, Jacobians, and Hessians
Complexity of Gradients, Jacobians, and Hessians
|of gradients, Jacobians, and Hessians ...
|... will perform. The theory of computational
|Computational Complexity Theory
Computational Complexity Theory
Emmons, Hamilton; Rai, Sanatan
|addresses this issue. ...
|... Unrestricted Parallelism For simplicity,
|Parallel Computing: Complexity Classes
Parallel Computing: Complexity Classes
Fürer, David Martin
|theory usually focuses on decision ...
|... (n 2); see [9 for details on algorithmic
|Np-Complete Problems and Proof Methodology
Np-Complete Problems and Proof Methodology
Rai, Sanatan; Vairaktarakis, George
|... programming, the terms degeneracy
|Complexity of Degeneracy
Complexity of Degeneracy
Murty, Katta G.
|of degeneracy degeneracy , and its ...
|... programming more apparent than in
|Complexity Theory: Quadratic Programming
Complexity Theory: Quadratic Programming
Vavasis, Stephen A.
|issues for quadratic programming. ...
|... an “interior” path, the concept of the
Terlaky, Tamaás; Boggs, Paul T.
|of solving a linear programming problem, a ...
|... ik , otherwise. In terms of computational
|Quadratic Assignment Problem
Quadratic Assignment Problem
Pitsoulis, Leonidas; Pardalos, Panos M.
|(cf. also ...
|... of communication rounds is a classic
|Responsive Round Complexity and Concurrent Zero-Knowledge
Responsive Round Complexity and Concurrent Zero-Knowledge
Cohen, Tzafrir; Kilian, Joe; Petrank, Erez
|measure for protocols; reducing round ...
|... predictive usefulness of such models. The
|FINITE COMPLETE SYSTEMS OF MANY-VALUED LOGIC ALGEBRAS
FINITE COMPLETE SYSTEMS OF MANY-VALUED LOGIC ALGEBRAS
Kohout, Ladislav J.
|of the normal forms as well as the ...
|... best fits and obtain their computational
|Regression by Special Functions
Regression by Special Functions
Ubhaya, Vasant A.
|... systems, regardless of their degree of
|CYBERNETICS AND Complex adaptive systems
CYBERNETICS AND Complex adaptive systems
Sage, Andrew P.
|, may be viewed as parts of a ...
|... to be shared by the incoming science of
|Sources of Complexity in Human Systems
Sources of Complexity in Human Systems
|... This is partially due to the fact that the
|Volume Computation for Polytopes: Strategies and Performances
Volume Computation for Polytopes: Strategies and Performances
|of volume computation algorithms increases ...
|... “Computational complexitycomputational
|” has two usages which must be ...
|... MST the CMST has been shown to be NP-hard
|Capacitated Minimum Spanning Trees
Capacitated Minimum Spanning Trees
|... nucleic acid sample, limiting the genetic
|Analysis of Nucleic Acids by Tandem Hybridization on Oligonucleotide Microarrays
Analysis of Nucleic Acids by Tandem Hybridization on Oligonucleotide Microarrays
Maldonado-Rodriguez, Rogelio; Beattie, Kenneth L.
|of a nucleic acid sample that can be ...
|... a large combinatorial problem, and the
|Mixed Integer Nonlinear Programming
Mixed Integer Nonlinear Programming
Floudas, Christodoulos A.
|analysis results characterize MINLP ...
|... responsible for both increases in the
|Intrinsically Driven Changes in Gene Interaction Complexity. I. Growth of Regulatory Complexes and Increase in Number of Genes
Intrinsically Driven Changes in Gene Interaction Complexity. I. Growth of Regulatory Complexes and Increase in Number of Genes
|of transcriptional control and increases ...
|... minmax problem Bilevel linear programming:
|Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs
Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs
Bard, Jonathan F.
|, equivalence to minmax, concave programs ...
|... atomicity that has $\Theta(\log N)$ time
|A new fast-path mechanism for mutual exclusion
A new fast-path mechanism for mutual exclusion
Anderson, James H.; Kim, Yong-Jik
|, where “time” is measured by counting ...