Výsledky vyhledávání - Algorithms—Algebraic algorithms

Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations

Autoři: Artur F. Izmaylov Robert A. Lang Tzu-Ching Yen

Zdroj: Physical Review A. 104

Témata: Chemical Physics (physics.chem-ph), Quantum Physics, Physics - Chemical Physics, 0103 physical sciences, FOS: Physical sciences, Quantum Physics (quant-ph), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/2107.08131
http://arxiv.org/abs/2107.08131

Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography

Autoři: Sriraman, Sridharan Balakrishnan, R. L'HENAFF, Vincent

Přispěvatelé: Sriraman, Sridharan Balakrishnan, R. L'HENAFF, Vincent

Témata: [INFO] Computer Science [cs]

Přístupová URL adresa: https://hal.science/hal-03544785v1

The Euler–Lagrange theory for Schur's Algorithm: Algebraic exposed points

Autoři: Sergey Khrushchev

Zdroj: Journal of Approximation Theory. 139:402-429

Témata: 0301 basic medicine, Wall continued fractions, Exposed points, Mathematics(all), Numerical Analysis, 03 medical and health sciences, Algebraic measures, Applied Mathematics, 0101 mathematics, 01 natural sciences, Analysis

Přístupová URL adresa: https://documat.unirioja.es/servlet/articulo?codigo=1967671
https://dialnet.unirioja.es/servlet/articulo?codigo=1967671
https://www.sciencedirect.com/science/article/abs/pii/S0021904505002066#!
https://dblp.uni-trier.de/db/journals/jat/jat139.html#Khrushchev06a
https://www.sciencedirect.com/science/article/pii/S0021904505002066
https://core.ac.uk/display/82172804

The sum-product algorithm: Algebraic independence and computational aspects

Autoři: MALVESTUTO, Francesco Mario

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, distributive law, junction tree, acyclic set system, sum-product algorithm

Přístupová URL adresa: https://hdl.handle.net/11573/508240

Grobner Bases of Acyclic Directed Graphs and Reductions in Conti-Traverso Algorithm (Algebraic Combinatorics on Convex Polytopes).

Autoři: Ishizeki, Takayuki

Témata: 410, Departmental Bulletin Paper., VoR.

URL: http://hdl.handle.net/2433/64484
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/64484/1/1175-5.pdf

Grobner Bases of Acyclic Directed Graphs and Reductions in Conti-Traverso Algorithm (Algebraic Combinatorics on Convex Polytopes)

Zdroj: Grobner Bases of Acyclic Directed Graphs and Reductions in Conti-Traverso Algorithm (Algebraic Combinatorics on Convex Polytopes). 1175:63-71

ALGORITHM FOR SOLVING THE PROBLEM OF ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE WITH DATAPATH OF TRANSITIONS BASED ON A MATRIX APPROACH

Autoři: R. M. Babakov A. A. Barkalov

Zdroj: KIBERNETYKA TA SYSTEMNYI ANALIZ. :14-21

Algorithms, algebraic structures and programs equivalences

Autoři: Lauria, Francesco E.

Témata: Data structures, Algorithms in computer science, Computability and recursion theory on ordinals, admissible sets, etc, Abstract data types, algebraic specification

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3599477

Investigation of the Internal Structure of Hard-to-Reach Objects Using a Hybrid Algorithm on the Example of Walls.

Autoři: Brociek, Rafał Szczotka, Józef Pleszczyński, Mariusz a další

Zdroj: Entropy; May2025, Vol. 27 Issue 5, p534, 18p

Témata: OPTIMIZATION algorithms, INVERSE problems, COMPUTED tomography, EQUATIONS, X-rays

An Algorithm for Solving the Problem of Algebraic Synthesis of a Finite-State Machine with Datapath of Transitions Based on a Matrix Approach.

Autoři: Babakov, R. M. Barkalov, A. A.

Zdroj: Cybernetics & Systems Analysis; May2025, Vol. 61 Issue 3, p347-353, 7p

Témata: PROBLEM solving, MATRICES (Mathematics), ALGORITHMS, PYTHON programming language, FLOW charts

The sum-product algorithm: algebraic independence and computational aspects

Autoři: Malvestuto, Francesco M.

Témata: keyword:sum-product algorithm, keyword:distributive law, keyword:acyclic set system, keyword:junction tree, msc:47A67, msc:62-09, msc:62C10, msc:68P15, msc:68W30

Popis souboru: application/pdf

Relation: reference:[1] Aji, S. M., McEliece, R. J.: The generalized distributive law.IEEE Trans. Inform. Theory 46 (2000), 325-343. Zbl 0998.65146, MR 1748973, 10.1109/18.825794; reference:[2] Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes.J. Assoc. Comput. Mach. 30 (1983), 479-513. Zbl 0624.68087, MR 0709830, 10.1145/2402.322389; reference:[3] Bernstein, P. A., Goodman, N.: The power of natural semijoins.SIAM J. Comput. 10 (1981), 751-771. MR 0635434, 10.1137/0210059; reference:[4] Goldman, S. A., Rivest, R. L.: Making maximum-entropy computations easier by adding extra constraints.In: Maximum-Entropy and Bayesian Methods in Science and Engineering 2 (G. J. Erikson and C. R. Smith, eds.), Kluwer Academic Pub. 1988, pp. 323-340. MR 0970828; reference:[5] Goodman, N., Shmueli, O., Tay, T.: GYO reductions, canonical connections, tree and cyclic schema, and tree projections.J. Comput. and System Sci. 29 (1984), 338-358. MR 0769592, 10.1016/0022-0000(84)90004-7; reference:[6] Kschinschang, F. R., Frey, B. J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm.IEEE Trans. Inform. Theory 47 (2001), 498-519. MR 1820474, 10.1109/18.910572; reference:[7] Maier, D., Ullman, J. D.: Connections in acyclic hypergraphs.Theoret. Comput. Sci. 32 (1984), 185-199. Zbl 0557.05054, MR 0761167, 10.1016/0304-3975(84)90030-6; reference:[8] Malvestuto, F. M.: Existence of extensions and product extensions for discrete probability distributions.Discrete Math. 69 (1988), 61-77. Zbl 0637.60021, MR 0935028, 10.1016/0012-365X(88)90178-1; reference:[9] Malvestuto, F. M.: From conditional independences to factorization constraints with discrete random variables.Ann. Math. Artif. Intel. 35 (2002), 253-285. Zbl 1001.68033, MR 1899954, 10.1023/A:1014551721406; reference:[10] Mezzini, M.: Fast minimal triangulation algorithm using minimum degree criterion.Theoret. Comput. Sci. 412 (2011), 3775-3787. Zbl 1220.05121, MR 2839718, 10.1016/j.tcs.2011.04.022; reference:[11] Tarjan, R. E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs.SIAM J. Comput. 13 (1984), 566-579. Zbl 0562.68055, MR 0749707, 10.1137/0213035

Dostupnost: http://hdl.handle.net/10338.dmlcz/143237

Probabilistic Algorithms for Computing Resultants

Autoři: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf.

Témata: Categories and Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms – Algebraic algorithms. General Terms, Algorithms Keywords, Sylvester’s resultant, polynomial resultants, modular algorithms, probabilistic algorithms

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440; http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440
http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf

Maximal Quotient Rational Reconstruction: An Almost Optimal Algorithm for Rational Reconstruction

Autoři: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf.

Témata: Categories and Descriptors, I.1.2 [Symbolic and Alge- braic Manipulation, Algorithms – Algebraic algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical algorithms and problems – Number-theoretic com- putations. General Terms, Algorithms Keywords, Euclidean Algorithm, Modular Algorithms, Ra- tional Reconstruction

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.3734; http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.3734
http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf

АЛГОРИТМ РОЗВ'ЯЗАННЯ ЗАДАЧІ АЛГЕБРАЇЧНОГО СИНТЕЗУ МІКРОПРОГРАМНОГО АВТОМАТА З ОПЕРАЦІЙНИМ АВТОМАТОМ ПЕРЕХОДІВ НА ОСНОВІ МАТРИЧНОГО ПІДХОДУ. (Ukrainian)

Alternate Title: ALGORITHM FOR SOLVING THE PROBLEM OF ALGEBRAIC SYNTHESIS OF A FINITE STATE MACHINE WITH DATAPATH OF TRANSITIONS BASED ON A MATRIX APPROACH. (English)

Autoři: БАБАКОВ, Р. М. БАРКАЛОВ, О. О.

Zdroj: Cybernetics & Systems Analysis / Kibernetiki i Sistemnyj Analiz; 2025, Issue 3, p14-21, 8p

Témata: FINITE state machines, PYTHON programming language, PROBLEM solving, ALGORITHMS, MATRICES (Mathematics)

Interactive textbook for algorithms and data structures

Autoři: Vesna Marinković Filip Marić

Zdroj: Journal of Educational Studies in Mathematics and Computer Science. 1:29-40

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

Optimization of Orthogonal Waveform Using Memetic Algorithm with Iterative Greedy Code Search.

Autoři: Wang, Wanbin Qian, Lu Zhou, Yun

Zdroj: Remote Sensing; Mar2025, Vol. 17 Issue 5, p856-1, 22p

Témata: OPTIMIZATION algorithms, ORTHOGONAL codes, GREEDY algorithms, MIMO systems, CROSS correlation

Greedy gradient-free adaptive variational quantum algorithms on a noisy intermediate scale quantum computer.

Autoři: Feniou, César Hassan, Muhammad Claudon, Baptiste a další

Zdroj: Scientific Reports; 5/28/2025, Vol. 15 Issue 1, p1-18, 18p

A Subdivision-Based Algorithm for the Sparse Resultant

Autoři: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Témata: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity

Popis souboru: application/postscript

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

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

Fast Determination and Computation of Self-intersections for NURBS Surfaces.

Autoři: KAI LI XIAOHONG JIA FALAI CHEN

Zdroj: ACM Transactions on Graphics; Apr2025, Vol. 44 Issue 2, p1-16, 16p

Témata: MANUFACTURING processes, INDUSTRIAL applications, GEOMETRY, MATHEMATICS, ALGORITHMS