New polynomial-time algorithms for Camion bases

DOI10.1016/J.DISC.2006.06.015zbMATH Open1105.05044OpenAlexW2149559545MaRDI QIDQ856883FDOQ856883

Authors: Komei Fukuda, Antoine Musitelli 

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/98383/files/FukMus%20camion%20bases.pdf

Recommendations

• A new algorithm for an \(S\)-polynomial
• Polynomial evaluation over finite fields: new algorithms and complexity bounds
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• New algorithms for generating Conway polynomials over finite fields
• scientific article; zbMATH DE number 1305433
• A new incremental algorithm for computing Groebner bases
• New deterministic algorithm for constructing normal bases in finite fields
• scientific article; zbMATH DE number 4029654
• A new polynomial bound and its efficiency
• scientific article; zbMATH DE number 691482

zbMATH Keywords

hyperplane arrangementpivot algorithm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Linear equations (linear algebraic aspects) (15A06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Simplicial cells in arrangements of hyperplanes
• Modules unimodulaires
• On unimodular matrices
• Orientation of matrices

Cited In (2)

• A nonextremal Camion basis
• Recognizing binet matrices

This page was built for publication: New polynomial-time algorithms for Camion bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856883)