Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

Lecture Notes in Computer Science - Germany
doi 10.1007/11761679_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Stakeholder Marketing: Theoretical Aspects and Introduction Problems

Socio-Economic Research Bulletin
2016English

Intertranslatability, Theoretical Equivalence, and Perversion

Thought
Philosophy
2018English

Algorithmic Aspects of Tree Amalgamation

Journal of Algorithms
2000English

Algorithmic Aspects of Bandwidth Trading

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

On Projective Equivalence of Univariate Polynomial Subspaces

Symmetry, Integrability and Geometry: Methods and Applications (SIGMA)
GeometryMathematical PhysicsAnalysisTopology
2009English

Algorithmic Aspects of Partial List Colourings

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2000English

Algorithmic Aspects of Acyclic Edge Colorings

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Some Algebraic and Algorithmic Problems in Acoustocerebrography

Bulletin of the Section of Logic
PhilosophyLogic
2016English

On Semi-Equivalence of Generically-Finite Polynomial Mappings

Mathematische Zeitschrift
Mathematics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy