Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Foundations of Computational Mathematics - Germany
doi 10.1007/s10208-002-0076-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Query Order and NP-completeness

English

Trusses, NP-Completeness, and Genetic Algorithms

2006English

Bi-Immunity Separates Strong NP-Completeness Notions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On Reducing and Deflating Subspaces of Matrices

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2004English

Computing Approximate Fekete Points by QR Factorizations of Vandermonde Matrices

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
2009English

Completeness and Riesz Bases of Reproducing Kernels in Model Subspaces

International Mathematics Research Notices
Mathematics
2006English

Generalized Signal Richness Preservation Problem and Vandermonde-Form Preserving Matrices

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2007English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

NP-Completeness of Minimal Width Unordered Tree Layout

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy