Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Computing methodologies → Combinatorial algorithms"'
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in \mathbb{F}_q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a4d7d4537a5c370a35c8b41c01bdd72
https://doi.org/10.46298/jgcc.2022.14.1.9431
https://doi.org/10.46298/jgcc.2022.14.1.9431
Autor:
Ishihata, Masakazu, Tokumasu, Fumiya
Solving paper-and-pencil puzzles is fun for people, and their analysis is also an essential issue in computational complexity theory. There are some practically efficient solvers for some NP-complete puzzles; however, the automatic generation of inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08d9919ad46146f6b7024217926a5c6d
Motivated by testing isomorphism of p-groups, we study the alternating matrix space isometry problem (AltMatSpIso), which asks to decide whether two m-dimensional subspaces of n × n alternating (skew-symmetric if the field is not of characteristic 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87e0daea41d00c363f91b5f079489aa9
LIPIcs, Volume 173, ESA 2020, Complete Volume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76d676a895e6b7518aac8f2a6e54772a
https://drops.dagstuhl.de/opus/volltexte/2020/12865/
https://drops.dagstuhl.de/opus/volltexte/2020/12865/
Autor:
Oki, Taihei
In this paper, we consider computing the degree of the Dieudonné determinant of a polynomial matrix A = A_l + A_{l-1} s + ⋯ + A₀ s^l, where each A_d is a linear symbolic matrix, i.e., entries of A_d are affine functions in symbols x₁, …, x_m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::199124a955795350206896efc475675b
We present a new method for computing a set of alternative origin-to-destination routes in road networks with an underlying time-dependent metric. The resulting set is aggregated in the form of a time-dependent alternative graph and is characterized
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d892233896cb688908c2f3453c638cc
Front Matter, Table of Contents, Preface, Conference Organization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1786db1ab7a16ffaeccf83c4230a19e
Autor:
Malić, Goran, Streinu, Ileana
Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid CM_n associated to the Cayley-Menger ideal for n points in 2D. We introduce c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::760302275d05e41b85dedb84e79b7508