Suchergebnisse - Algorithms—algebraic algorithms General Terms Algorithms

Algorithms for near-rings of non-linear transformations

Autoren: Franz Binder Erhard Aichinger Jürgen Ecker et al.

Weitere Verfasser: Franz Binder Erhard Aichinger Jürgen Ecker et al.

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

Schlagwörter: 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

Dateibeschreibung: application/postscript

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

Verfügbarkeit: 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

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

Autoren: Feniou, César Hassan, Muhammad Claudon, Baptiste et al.

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

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

Autoren: Brociek, Rafał Szczotka, Józef Pleszczyński, Mariusz et al.

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

Schlagwörter: OPTIMIZATION algorithms, INVERSE problems, COMPUTED tomography, EQUATIONS, X-rays

Rational General Solutions of Algebraic Ordinary Differential Equations

Autoren: Ruyong Feng Xiao-shan Gao The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Ruyong Feng Xiao-shan Gao The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.mmrc.iss.ac.cn/~xgao/paper/p42-feng.pdf.

Schlagwörter: TION, Algorithms—Algebraic algorithms General Terms Algorithms, Theory Keywords Rational general solution, algebraic differential equation, au- tonomous first order ODE

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.580.6948
http://www.mmrc.iss.ac.cn/~xgao/paper/p42-feng.pdf

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples.

Autoren: Adcock, Ben Brugiapaglia, Simone Dexter, Nick et al.

Quelle: Memoirs of the European Mathematical Society; 2024, Vol. 13, piii-104, 103p

Schlagwörter: STOCHASTIC differential equations, SPARSE approximations, HOLOMORPHIC functions, COMPRESSED sensing, HILBERT space

I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms—Algebraic algorithms General Terms Algorithms

Autoren: Yongjae Cha Mark Van Hoeij The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Yongjae Cha Mark Van Hoeij The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.math.fsu.edu/~hoeij/papers/issac09/J.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.402; http://www.math.fsu.edu/~hoeij/papers/issac09/J.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.402
http://www.math.fsu.edu/~hoeij/papers/issac09/J.pdf

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

Autoren: Wang, Wanbin Qian, Lu Zhou, Yun

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

Schlagwörter: OPTIMIZATION algorithms, ORTHOGONAL codes, GREEDY algorithms, MIMO systems, CROSS correlation

A quantum eigenvalue solver based on tensor networks.

Autoren: Leimkuhler, Oskar Whaley, K. Birgitta

Quelle: NPJ Quantum Information; 11/25/2025, Vol. 11 Issue 1, p1-16, 16p

Schlagwörter: QUANTUM computing, COMPUTATIONAL chemistry, QUANTUM electronics, BOUND states, QUANTUM noise, MATRIX multiplications

Differential Forms in Computational Algebraic Geometry (Extended Abstract)

Autoren: Peter Bürgisser Peter Scheiblechner The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Peter Bürgisser Peter Scheiblechner The Pennsylvania State University CiteSeerX Archives

Quelle: http://math-www.upb.de/agpb/work/1diff-forms.pdf.

Schlagwörter: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Theory Keywords complexity

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.4043
http://math-www.upb.de/agpb/work/1diff-forms.pdf

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions From Limited Samples

Autoren: Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga

Resource Type: eBook.

Schlagworte: Characteristic functions, Approximation theory, Polynomials

Categories: SCIENCE / Physics / Mathematical & Computational

Cylindrical Algebraic Decompositions for Boolean Combinations

Autoren: Russell Bradford James H. Davenport Matthew England et al.

Weitere Verfasser: Russell Bradford James H. Davenport Matthew England et al.

Quelle: http://opus.bath.ac.uk/33926/5/England_ISSAC2013.pdf.

Schlagwörter: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, Analysis of algorithms General Terms Algorithms, Experimentation, Theory Keywords cylindrical algebraic decomposition, equational

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.2981; http://opus.bath.ac.uk/33926/5/England_ISSAC2013.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.2981
http://opus.bath.ac.uk/33926/5/England_ISSAC2013.pdf

On Lacunary Polynomial Perfect Powers

Autoren: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf.

Schlagwörter: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, Analysis of algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, Number-theoretic computations General Terms Algorithms Keywords Lacunary polynomial, black box polynomial, sparse polynomial, perfect

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774
http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf

Lower bounds for zero-dimensional projections

Autoren: W. Dale Brownawell Chee K. Yap The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: W. Dale Brownawell Chee K. Yap The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.nyu.edu/exact/doc/zero-bound-proj.pdf.

Schlagwörter: F.2.2 [Analysis of Algorithms and Problem Complex- ity, Nonnumerical Algorithms and Problems —Geometri- cal Problems and Computations, I.1.2 [Symbolic and Al- gebraic Manipulation, Algorithms—Algebraic Algorithms General Terms Algorithms, Theory Keywords Exact numerical algorithms, Zero Bounds, Nullstellensatz, Chow Form, Transcendence Theory

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.603.5416
http://www.cs.nyu.edu/exact/doc/zero-bound-proj.pdf

Transformer-based quantum error decoding enhanced by QGANs: towards scalable surface code correction algorithms.

Autoren: Tian, Cewen Fan, Zaixu Guo, Xiaoxuan et al.

Quelle: EPJ Quantum Technology; 6/19/2025, Vol. 12 Issue 1, p1-27, 27p

Schlagwörter: GENERATIVE adversarial networks, REINFORCEMENT learning, QUANTUM computing, TRANSFORMER models, QUBITS, DEEP learning

Proximity Gaps for Reed--Solomon Codes.

Autoren: BEN-SASSON, ELI CARMON, DAN ISHAI, YUVAL et al.

Quelle: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-57, 57p

Schlagwörter: HAMMING distance, PROXIMITY spaces, REED-Solomon codes, DECODING algorithms, BAND gaps

Geografische Kategorien: SUDAN

A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs.

Autoren: Arnau, Roger Calabuig, José M. García-Raffi, Luis M. et al.

Quelle: Mathematics (2227-7390); Aug2024, Vol. 12 Issue 16, p2590, 16p

Schlagwörter: FRAUD investigation, DIRECTED graphs, GRAPH algorithms, FRAUD, INTERMEDIATION (Finance), WEIGHTED graphs

Firma/Körperschaft: FORD Motor Co.

A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems.

Autoren: E.-Nagy, Marianna Varga, Anita

Quelle: Journal of Optimization Theory & Applications; Jul2024, Vol. 202 Issue 1, p76-107, 32p

Schlagwörter: LINEAR complementarity problem, GREEDY algorithms, INTERIOR-point methods, ALGORITHMS, MATHEMATICAL programming

Using small-scale quantum devices to solve algebraic equations.

Autoren: Li, Hongshu Ma, Zhi Wang, Hong et al.

Quelle: Quantum Information Processing; Apr2021, Vol. 20 Issue 4, p1-15, 15p

Schlagwörter: PROBLEM solving, NP-hard problems, ALGORITHMS, ALGEBRAIC equations

Tackling Permutation-based Optimization Problems with an Algebraic Particle Swarm Optimization Algorithm.

Autoren: Santucci, Valentino Baioletti, Marco Milani, Alfredo et al.

Quelle: Fundamenta Informaticae; 2019, Vol. 167 Issue 1/2, p133-158, 26p

Schlagwörter: MATHEMATICAL optimization, PARTICLE swarm optimization, COMBINATORIAL optimization, VECTOR spaces, PERMUTATIONS

Comparison of beta peak detection algorithms for data-driven deep brain stimulation programming strategies in Parkinson's disease.

Autoren: Baker, Sunderland K. Radcliffe, Erin M. Kramer, Daniel R. et al.

Quelle: NPJ Parkinson's Disease; 8/9/2024, Vol. 10 Issue 1, p1-12, 12p