Leopoldt’s Conjecture in Parameterized Families

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-1988-0958040-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Some Hard Families of Parameterized Counting Problems

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Parameterized Synthesis

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Parameterized Hash Functions

Annales UMCS, Informatica
2012English

Parameterized Concept Weighting in Verbose Queries

2011English

Parameterized Codes Over Cycles

Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Applied MathematicsAnalysis
2013English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Goldbach Conjecture

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy