On the Complexity and Approximation of Non-Unique Probe Selection Using D-Disjunct Matrix

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-008-9188-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On the Computational Complexity of Approximation Operators Ii

1976English

On the Complexity of Polynomial Matrix Computations

2003English

Elements of the Complexity and the Approximation Theory

English

On the Computational Complexity of Matrix Semigroup Problems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

The Complexity of Simulation and Matrix Multiplication

2017English

Geometry and the Complexity of Matrix Multiplication

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
2008English

Complexity and Approximation of Satisfactory Partition Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Extracellular Matrix: Understanding the Complexity

Brazilian Journal of Medical and Biological Research
ImmunologyCell BiologyPharmacologyBiochemistryBiophysicsNeuroscienceMedicineToxicologyPhysiologyPharmaceutics
1999English

Approximation and Parameterized Complexity of Minimax Approval Voting

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy