Výsledky vyhledávání - ACM: I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms - Algebraic algorithms~

Solving Sparse Integer Linear Systems

Autoři: Eberly, Wayne Giesbrecht, Mark Giorgi, Pascal a další

Přispěvatelé: Eberly, Wayne Giesbrecht, Mark Giorgi, Pascal a další

Zdroj: https://hal.science/hal-00021456 ; 2006.

Témata: Sparse integer matrix, linear system solving, structured matrix, ACM: I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms - Algebraic algorithms, analysis of algorithms, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/cs.SC/0603082; ARXIV: cs.SC/0603082

Dostupnost: https://hal.science/hal-00021456
https://hal.science/hal-00021456v1/document
https://hal.science/hal-00021456v1/file/eggsv.pdf

Computing specified generators of structured matrix inverses

Autoři: Jeannerod, Claude-Pierre Mouilleron, Christophe Computer arithmetic (ARENAIRE) a další

Přispěvatelé: Jeannerod, Claude-Pierre Mouilleron, Christophe Computer arithmetic (ARENAIRE) a další

Zdroj: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation ; 35th International Symposium on Symbolic and Algebraic Computation (ISSAC 2010) ; https://ens-lyon.hal.science/ensl-00450272 ; 35th International Symposium on Symbolic and Algebraic Computation (ISSAC 2010), Jul 2010, Münich, Germany. ⟨10.1145/1837934.1837988⟩

Témata: Structured linear algebra, matrix inversion, ACM I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulation - Algebraic Algorithms, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Geografické téma: Münich, Germany

Dostupnost: https://ens-lyon.hal.science/ensl-00450272
https://ens-lyon.hal.science/ensl-00450272v1/document
https://ens-lyon.hal.science/ensl-00450272v1/file/JeannerodMouilleron2010.pdf
https://doi.org/10.1145/1837934.1837988

Algorithms for near-rings of non-linear transformations

Autoři: Franz Binder Erhard Aichinger Jürgen Ecker a další

Přispěvatelé: Franz Binder Erhard Aichinger Jürgen Ecker a další

Zdroj: http://www.algebra.uni-linz.ac.at/~xbx/pub/issac2000/algos4.ps.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms--algebraic algorithms, G.2 [Mathematics and Computing, Discrete Mathematics General Terms Algorithms Keywords Near-rings, Non-linear transformations, Groups

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.5164

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.5164
http://www.algebra.uni-linz.ac.at/~xbx/pub/issac2000/algos4.ps

Solving toeplitz- and vandermonde-like linear systems with large displacement rank

Autoři: Bostan, Alin Jeannerod, Claude-Pierre Schost, Éric

Přispěvatelé: Bostan, Alin Jeannerod, Claude-Pierre Schost, Éric

Zdroj: Proceedings of the 2007 international symposium on Symbolic and algebraic computation. :33-40

Témata: Structured linear algebra, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Dense linear algebra, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulation -Algebraic Algorithms Algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.inria.fr/hal-03420744/file/BoJeSc07.pdf
https://dl.acm.org/doi/10.1145/1277548.1277554
https://specfun.inria.fr/bostan/publications/BoJeSc07.pdf
http://perso.ens-lyon.fr/claude-pierre.jeannerod/papers/issac07.pdf
https://hal.inria.fr/hal-03420744/document
http://core.ac.uk/display/20747684
https://core.ac.uk/display/20747684

From Sylvester-Gallai Configurations to Rank Bounds: Improved Blackbox Identity Test for Depth-3 Circuits

Autoři: Nitin Saxena C. Seshadhri The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Nitin Saxena C. Seshadhri The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.math.uni-bonn.de/people/saxena/papers/quad-rank-bound.pdf.

Témata: Categories and Subject Descriptors, F.1.1 [Computation by abstract devices, Circuits, I.1.2 [Symbolic and algebraic manipulation, Algebraic Algorithms, G.2.1 [Discrete mathematics, Combinatorics General Terms, Algorithms, Theory Additional Key Words and Phrases, Chinese remaindering, combinatorial design, depth-3 circuit, ideal the- ory, identities, incidence geometry, Sylvester-Gallai ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.630.5804

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.630.5804
http://www.math.uni-bonn.de/people/saxena/papers/quad-rank-bound.pdf

Multivariate power series multiplication

Autoři: Éric Schost The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Éric Schost The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csd.uwo.ca/faculty/eschost/publications/SeriesProduct.pdf.

Témata: Categories and Subject Descriptors I.1.2 [Computing Methodologies, Symbolic and Algebraic Manipulation—Algebraic Algorithms General Terms Algorithms, Experimentation, Theory Keywords Power series, multiplication

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.5237; http://www.csd.uwo.ca/faculty/eschost/publications/SeriesProduct.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.5237
http://www.csd.uwo.ca/faculty/eschost/publications/SeriesProduct.pdf

Products of ordinary differential operators by evaluation and interpolation

Autoři: Alin Bostan Frédéric Chyzak Nicolas Le Roux a další

Přispěvatelé: Alin Bostan Frédéric Chyzak Nicolas Le Roux a další

Zdroj: http://arxiv.org/pdf/0804.2181v1.pdf.

Témata: I.1.2 [Computing Methodologies, Symbolic and Algebraic Manipulation – Algebraic Algorithms General Terms, Algorithms, Theory Keywords, Fast algorithms, differential operators

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.312.9360; http://arxiv.org/pdf/0804.2181v1.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.312.9360
http://arxiv.org/pdf/0804.2181v1.pdf

Multihomogeneous polynomial decomposition using moment matrices

Autoři: Ra Bernardi Pierre Comon Bernard Mourrain a další

Přispěvatelé: Ra Bernardi Pierre Comon Bernard Mourrain a další

Zdroj: https://hal.inria.fr/inria-00638837/document/.

Témata: sition, I.1.2 [Computing Methodologies, Symbolic and Algebraic Manipulation—Algebraic algorithms General Terms Algorithms, Theory Keywords Moment matrix, multihomogeneous polynomial decomposi- tion, tensor decomposition

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.651.5353

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.651.5353

Twenty-six moves suffice for Rubik’s cube

Autoři: Daniel Kunkle The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Daniel Kunkle The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.ccs.neu.edu/home/gene/papers/rubik.pdf.

Témata: Categories and Subject Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algebraic algorithms General Terms, Algorithms, Experimentation Keywords, Rubik’s cube, upper bound, permutation groups, fast multiplication, disk-based

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.2413; http://www.ccs.neu.edu/home/gene/papers/rubik.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.2413
http://www.ccs.neu.edu/home/gene/papers/rubik.pdf

Good reduction of Puiseux series and complexity of the Newton-Puiseux algorithm over finite fields

Autoři: Adrien Poteaux Marc Rybowicz Université De Limoges a další

Přispěvatelé: Adrien Poteaux Marc Rybowicz Université De Limoges a další

Zdroj: http://www.lifl.fr/~poteaux/fichiers/puiseux_issac08.pdf.

Témata: Categories and Subjects Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems. General Terms, Theory. Keywords, Puiseux Series, Algebraic Functions, Modular Methods, Finite Fields, Complexity, Symbolic-Numeric Algorithms

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.5684; http://www.lifl.fr/~poteaux/fichiers/puiseux_issac08.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.5684
http://www.lifl.fr/~poteaux/fichiers/puiseux_issac08.pdf

Low complexity algorithms for linear recurrences

Autoři: A. Bostan F. Chyzak B. Salvy a další

Přispěvatelé: A. Bostan F. Chyzak B. Salvy a další

Zdroj: http://perso.ensil.unilim.fr/~cluzeau/BCCS.pdf.

Témata: Categories and Subject Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Experimentation, Theory Keywords, Computer algebra, polynomial and rational solutions, linear recurrences

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.3722; http://perso.ensil.unilim.fr/~cluzeau/BCCS.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.3722
http://perso.ensil.unilim.fr/~cluzeau/BCCS.pdf

Essentially optimal interactive certificates in linear algebra

Autoři: Dumas, Jean-Guillaume Kaltofen, Erich Calculs Algébriques et Systèmes Dynamiques (CASYS) a další

Přispěvatelé: Dumas, Jean-Guillaume Kaltofen, Erich Calculs Algébriques et Systèmes Dynamiques (CASYS) a další

Zdroj: ACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2014) ; https://hal.science/hal-00932846 ; ACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), Jul 2014, Kobe, Japan. pp.146-153, ⟨10.1145/2608628.2608644⟩

Témata: Fiat-Shamir heuristic, sigma-protocol, output validation, randomization, linear-time checkable proof, matrix rank, matrix characteristic polynomial, positive semidefiniteness, I.1.2 Computing Methodologies (Symbolic and Algebraic Manipulation), [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Geografické téma: Kobe, Japan

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1401.4567; ARXIV: 1401.4567

Dostupnost: https://hal.science/hal-00932846
https://hal.science/hal-00932846v4/document
https://hal.science/hal-00932846v4/file/interactive_report.pdf
https://doi.org/10.1145/2608628.2608644

Differential equations for algebraic functions

Autoři: Alin Bostan Frédéric Chyzak Bruno Salvy a další

Přispěvatelé: Alin Bostan Frédéric Chyzak Bruno Salvy a další

Zdroj: http://hal.inria.fr/docs/00/17/21/67/PDF/BoChLeSaSc07-hal.pdf.

Témata: Categories and Subject Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Experimentation, Theory Keywords, Computer algebra, algebraic series, differential resolvents

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.5822

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.5822
http://hal.inria.fr/docs/00/17/21/67/PDF/BoChLeSaSc07-hal.pdf

Efficient computation of the characteristic polynomial

Autoři: Jean-guillaume Dumas Université Joseph Fourier The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Jean-guillaume Dumas Université Joseph Fourier The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~cpernet/Publications/charpoly_issac05.pdf.

Témata: Categories and Subject Descriptors G.4 [Mathematics and Computing, Mathematical Software—Algorithm Design and Analysis, I.1.2 [Computing Methodologies, Symbolic and Algebraic Manipulation General Terms Algorithms, Experimentation Keywords Characteristic polynomial, minimal polynomial, Keller-Gehrig, probabilistic algorithm, finite field, integer

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6698; http://www.cs.uwaterloo.ca/~cpernet/Publications/charpoly_issac05.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6698
http://www.cs.uwaterloo.ca/~cpernet/Publications/charpoly_issac05.pdf

Towards better simplification of elementary functions

Autoři: James Beaumont Russell Bradford James H. Davenport a další

Přispěvatelé: James Beaumont Russell Bradford James H. Davenport a další

Zdroj: http://staff.bath.ac.uk/masjhd/ISSACs/ISSAC03-final.pdf.

Témata: I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms Algorithms, Theory Keywords Simplification Power Series

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.3649

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.3649
http://staff.bath.ac.uk/masjhd/ISSACs/ISSAC03-final.pdf

Optimal Complexity Lower Bound for Polynomial Multiplication

Autoři: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math-www.upb.de/agpb/work/bcbc-fin.pdf.

Témata: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebraic complexity, bilinear circuits, cyclic convolution, Fast Fourier Transform, lower bounds, polynomial multiplication, singular values, rigidity

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091
http://math-www.upb.de/agpb/work/bcbc-fin.pdf

Lower bounds on the bounded coefficient complexity of bilinear maps

Autoři: Peter Bürgisser Universität Paderborn Martin Lotz a další

Přispěvatelé: Peter Bürgisser Universität Paderborn Martin Lotz a další

Zdroj: http://arxiv.org/pdf/cs/0301016v1.pdf.

Témata: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebraic complexity, bilinear circuits, lower bounds, singular

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6162; http://arxiv.org/pdf/cs/0301016v1.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6162
http://arxiv.org/pdf/cs/0301016v1.pdf

Low Complexity Algorithms for Linear Recurrences

Autoři: A. Bostan F. Chyzak B. Salvy a další

Přispěvatelé: A. Bostan F. Chyzak B. Salvy a další

Zdroj: http://algo.inria.fr/bostan/publications/BoChClSa06.pdf.

Témata: Categories and Subject Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Experimentation, Theory Keywords, Computer algebra, polynomial and rational solutions, linear recurrences

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.5019; http://algo.inria.fr/bostan/publications/BoChClSa06.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.5019
http://algo.inria.fr/bostan/publications/BoChClSa06.pdf

An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences.

Autoři: Kauers, Manuel

Zdroj: ACM Transactions on Algorithms; 2007, Vol. 3 Issue 2, p1-14, 14p

Témata: ALGORITHMS, RECURSIVE sequences (Mathematics), ZERO (The number), EQUIVALENCE classes (Set theory), MATHEMATICAL sequences, POLYNOMIALS, ALGEBRA

Assignment Problem in Content Distribution Networks: Unsplittable Hard-Capacitated Facility Location.

Autoři: Bateni, Mohammadhossein Hajiaghayi, Mohammadtaghi

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 3, p1-19, 19p

Témata: INFORMATION storage & retrieval systems, CLIENT/SERVER computing, COMPUTER networks, APPROXIMATION algorithms, FACILITY location problems, COMPUTER scheduling, COST analysis