Keywords: 68W30; 68Q17; 68W40; Matrix multiplication; Complexity; Algorithm; FFT; Bluestein reduction;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 68Q17; 13D02; 14L30; 20B30; Computational complexity; Free resolution; Determinant; Permanent;
Keywords: Adaptive lasso; Bayesian inference; Gibbs sampler; Hierarchical model; Linear regression; 62J05; 68Q17; 62H12;
Keywords: 05C15; 05C31; 05C85; 68Q17; 68W05; Graph polynomials; Counting complexity; Chromatic polynomial;
Keywords: 68Q17; 15A69; 16Z05; Tensor rank; Border rank; Algebraic complexity theory; Quantum information theory; W-state;
Keywords: 20C30; 15A86; 68Q17; Geometric complexity theory; Matrix powering; Symmetric Kronecker coefficients;
Keywords: 20E08; 20F10; 20M05; 20M18; 68Q17; 68Q45; 20M30; Automaton groups; Automaton semigroups; Word problem; PSpace;
Keywords: 68Q17; 13A50; 14L24; Geometric complexity theory; Invariants; Orbit closure; Non-normality; Alon-Tarsi conjecture;
Keywords: 68Q17; 15A86; 14L40; 16G20Iterated Matrix Multiplication; Symmetry group of a polynomial; Dual degeneracy; Jacobian loci of hypersurfaces; Degeneration of quiver orbits
Keywords: 03B70; 03D15; 03F20; 68Q17; Bounded arithmetic; Circuit lower bounds;
Keywords: 68Q17; 15A23; 15A80Complexity theory; Matrix factorization; Tropical semiring
Keywords: 03E60; 03E35; 03B70; 68Q45; 03D05; 68Q15; 68Q17; 03E15Automata and formal languages; Logic in computer science; Gale–Stewart games; 2-tape Büchi automaton; 1-counter automaton; Determinacy; Effective analytic determinacy; Models of set theory; Independenc
Keywords: 68T20; 68Q17; 03D15; 68T27; 68Q87; 91A60Game tree; AND–OR tree; OR–AND tree; Independent identical distribution; Computational complexity
Word problems in Elliott monoids
Keywords: primary; 46L80; 47L30; secondary; 03D40; 06B25; 06D35; 06F20; 08A50; 20F10; 47L40; 68Q17; 68Q19; AF algebra; Word problem; Elliott classification; Effros-Shen algebra; Behncke-Leptin algebras; Farey AF algebra;
Cryptanalysis of Riccati equation encryption schemes TP-I and TP-II
Keywords: 94A60; 14G50; 12Y05; 12E20; 68Q17; 03D15; TP-I (Tsafenat-Paaneah-I); TP-II (Tsafenat-Paaneah-II); Public-key encryption schemes; Algebraic Riccati equations;
Hardness result for the total rainbow k-connection of graphs
Keywords: Total-rainbow k-connection number; Computational complexity; NP-complete; 05C15; 05C40; 68Q17; 68Q25; 68R10;
Computing the k-metric dimension of graphs
Keywords: k-metric dimension; k-metric dimensional graph; Metric dimension; NP-complete problem; NP-hard problem; Graph algorithms; 68Q17; 05C05; 05C12; 05C85;
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Keywords: 20C30; 20G05; 68Q17; Kronecker coefficients; Plethysm coefficients; Geometric complexity theory; Positivity;
Abelian tensors
Keywords: 68Q17; 14L30; 15A69; Tensor; Commuting matrices; Strassen's equations;
On the computability of equitable divisions
Keywords: 91B32; 68Q17; 05D05Cake cutting; Equitable division; Algorithm; Approximation
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
Keywords: 68Q17; 03D15; 03F25; 03F30Proof complexity; Bounded arithmetic; Search problems; Finite games; Computational complexity; Equilibria
Lattice-based algorithms for number partitioning in the hard phase
Keywords: 90C10; 68Q17; 06B99; 05C15Number partitioning; Closest vector problem; Basis reduction; MIP
Monoid generalizations of the Richard Thompson groups
Keywords: 20F10; 20F05; 20M05; 68Q17
Approximability results for the maximum and minimum maximal induced matching problems
Keywords: 68W25; 68Q17; 05C69; 05C70Combinatorial optimization; Induced matching; Bipartite graph; Approximability; NP-completeness
εε-optimization schemes and LL-bit precision: Alternative perspectives for solving combinatorial optimization problems
Keywords: primary; 68Q17; 68Q25; 68W25; 68W40; 90C27; 90C60Approximation schemes; Combinatorial optimization; Computational complexity; Inverse optimization
A challenging nonlinear problem for numerical techniques
Keywords: 34B15; 68Q17; 65L12; 65L17; Multiple solution; Nonlinearity; Sensitivity to boundary conditions;
Structures interpretable in models of bounded arithmetic
Keywords: 03H15; 68Q17; 03F30; Bounded arithmetic; Arithmetic with a top; Weak pigeonhole principle;
Control structures in programs and computational complexity
Keywords: 03D15; 03D20; 68N15; 68N18; 68N30; 68Q15; 68Q17; 68W40; 03-02; Implicit computational complexity; Imperative programming languages; Grzegorczyk hierarchy; Higher type recursion; Lambda calculus; Polynomial time;
The complexity of finite model reasoning in description logics
Keywords: 03B70; 03D15; 68Q17; Description logic; Finite satisfiability; Number restrictions;