Upper Bounds on the Complexity of Some Galois Theory Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24587-2_73
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Some Order Dimension Bounds for Communication Complexity Problems

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1991English

Some New Aspects of the Galois Theory

English

Note on Some Upper Bounds for the Condition Number

Journal of Mathematical Inequalities
Analysis
2014English

On the Complexity of Some Common Geometric Location Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

Some Lower Bounds for the Complexity of Continuation Methods

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1998English

On the Complexity of Undecidable Problems in Automata Theory

1967English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Some Upper Bounds Related With Domination Number

Journal of the Operations Research Society of China
Management ScienceApplied MathematicsOperations ResearchMathematics
2013English

On the Inverse Problem of Galois Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy