Amanote Research

Amanote Research

    RegisterSign In

On the Computational Complexity of Matrix Semigroup Problems

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2012-663
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 2012

Authors
Paul C. BellIgor Potapov
Publisher

IOS Press


Related search

Computational Problems Concerning the Hilbert Matrix

Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
1961English

Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Computational Complexity of Some Optimization Problems in Planning

English

Computational Complexity Analysis of Global Optimization for the Matrix Product Eigenvalue Problem

Transactions of the Society of Instrument and Control Engineers
2001English

On the Complexity of Polynomial Matrix Computations

2003English

On the Computational Complexity of Approximation Operators Ii

1976English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

PLoS ONE
Multidisciplinary
2013English

Computational Complexity and Knowledge Complexity

SIAM Journal on Computing
MathematicsComputer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy