Showcasing straight-line programs with memory via matrix Bruhat decomposition

被引：0

作者：

Niemeyer, Alice C. ^{[1
]}

Popiel, Tomasz ^{[2
]}

Praeger, Cheryl E. ^{[3
]}

Rademacher, Daniel ^{[1
]}

机构：

[1] Rhein Westfal TH Aachen, Chair Algebra & Representat Theory, Pontdriesch 10-16, D-52062 Aachen, Germany

[2] Monash Univ, Sch Math, 9 Rainforest Walk, Clayton, Vic 3800, Australia

[3] Univ Western Australia, Ctr Math Symmetry & Computat, 35 Stirling Highway, Crawley, WA 6009, Australia

来源：

INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION | 2024年 / 34卷 / 07期

基金：

澳大利亚研究理事会;

关键词：

Straight-Line program; Complexity of algorithms; Bruhat decomposition; memory complexity;

D O I：

10.1142/S0218196724500413

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We suggest that straight-line programs designed for algebraic computations should be accompanied by a comprehensive complexity analysis that takes into account both the number of fundamental algebraic operations needed, as well as memory requirements arising during evaluation. We introduce an approach for formalizing this idea and, as illustration, construct and analyze straight-line programs for the Bruhat decomposition of d x d matrices with determinant 1 over a finite field of order q that have length O(d2log(q)) and require storing only O(log(q)) matrices during evaluation.

引用

页码：1059 / 1090

页数：32

共 50 条

[41] PROBABILISTIC ALGORITHMS AND STRAIGHT-LINE PROGRAMS FOR SOME RANK DECISION-PROBLEMS
IBARRA, OH
MORAN, S
ROSIER, LE
INFORMATION PROCESSING LETTERS, 1981, 12 (05) : 227 - 232
[42] Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
Huang, Qiao-Long
Gao, Xiao-Shan
JOURNAL OF SYMBOLIC COMPUTATION, 2020, 101 : 367 - 386
[43] Abased register allocation PF for straight-line programs is NP-complete
Lee, Jonathan K.
Palsberg, Jens
Pereira, Fernando Magno Quintao
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 680 - +
[44] THE PLANNING OF A STRAIGHT-LINE TRAJECTORY VIA INTERACTIVE COMPUTER-GRAPHICS
WANG, KS
LIEN, TK
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 1989, 5 (2-3) : 215 - 221
[45] An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Bannai, Hideo
Gagie, Travis
Tomohiro, I
Inenaga, Shunsuke
Landau, Gad M.
Lewenstein, Moshe
INFORMATION PROCESSING LETTERS, 2012, 112 (19) : 711 - 714
[46] Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Fuhs, Carsten
Schneider-Kamp, Peter
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 71 - +
[47] On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
Allender, Eric
Balaji, Nikhil
Datta, Samir
Pratap, Rameshwar
COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2023, 12 (02): : 145 - 173
[48] COMPLETE BASIS-SET VIA STRAIGHT-LINE COHERENT-STATE SUPERPOSITIONS
ADAM, P
FOLDESI, I
JANSZKY, J
PHYSICAL REVIEW A, 1994, 49 (02): : 1281 - 1287
[49] Complete worst-case execution time analysis of straight-line hard real-time programs
Stappert, F
Altenbernd, P
JOURNAL OF SYSTEMS ARCHITECTURE, 2000, 46 (04) : 339 - 355
[50] DESIGN OF A NEW FULLY COMPLIANT TRANSLATIONAL JOINT VIA STRAIGHT-LINE MOTION MECHANISM BASED METHOD
Garcia, Sonia C.
Gallego-Sanchez, Juan A.
PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2019, VOL 5A, 2020,

← 1 2 3 4 5 →