Sets of Linear Forms Which Are Hard to Compute

DOI10.4230/LIPICS.MFCS.2021.66MaRDI QIDQ6168484zbMATH OpenOpenAlexFDO

Authors

Publication date 8 August 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2021/14506/pdf/LIPIcs-MFCS-2021-66.pdf/

zbMATH Keywords

additive complexityeffective Lindemann-Weierstrass theoremeffective Perron theoremlinear algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On sets of linear forms of maximal complexity
• Linear forms in finite sets of integers
• The complexity of linear problems in fields
• Binary linear forms over finite sets of integers
• Hard satisfiable formulas for splittings by linear combinations
• On heterogeneous linear forms
• scientific article; zbMATH DE number 2070405
• Some computational problems in linear algebra as hard as matrix multiplication
• Linear forms of a given Diophantine type
• The hardness of computing an eigenform

Cited in

(1)

• On sets of linear forms of maximal complexity

This page was built for publication: Sets of Linear Forms Which Are Hard to Compute

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