Keywords: 03D15; 20F65; 20F10; 68Q45Subset sum problem; Knapsack problem; Bounded subgroup membership problem; Rational subset membership problem; Free products; Direct products; Hyperbolic groups; Nilpotent groups
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 03B70; 03D15; 03F20; 68Q17; Bounded arithmetic; Circuit lower bounds;
Keywords: 15A15; 15A69; 15A24; 18D10; 03D15; Counting complexity; Tensor network; Monoidal categories;
Keywords: 03D15; 20F65; 20F10; Solvable groups; Metabelian groups; Word problem; Cyclic subgroup membership; Power problem; Conjugacy problem; Randomized algorithms;
Keywords: 03F03; 03F50; 03D15; 68Q15; Polytime computability; Applicative theories; Truth theories;
Keywords: 03D15; 20F65; 20F10; 20F16; Polycyclic groups; Nilpotent groups; Subset sum problem; NP-completeness;
Keywords: 03C45; 03C13; 03D15; 03B70Rosy theories; Finite structures; Fraisse classes; Coordinatization; Hierarchical decomposition; Algorithmic meta-theorems
Keywords: 03D15; 03D20; 03E99; 68Q15Set function; Polynomial time; Cobham Recursion; Smash function; Hereditarily finite; Rudimentary function
Keywords: 68T20; 68Q17; 03D15; 68T27; 68Q87; 91A60Game tree; AND–OR tree; OR–AND tree; Independent identical distribution; Computational complexity
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;
Grassmann homomorphism and Hajós-type theorems
Keywords: 20G40; 14M15; 05C15; 03D15; Hajós construction; Finite Grassmannian; Homomorphism; Combinatorics; Complexity classes; Graph theory;
Ulrich complexity
Keywords: 03D15; 14-04; Ulrich modules; Complexity of computation; Permanents;
On two extensions of equimatchable graphs
Keywords: 05C70; 05C69; 05C51; 03D15; Minimum maximal matching; Equimatchable graph; Edge dominating set; Gallai-Edmonds decomposition; Parameterized complexity;
Avoiding uniformity in the Î20 enumeration degrees
Keywords: 03D30; 03D55; 03D15; 03D25; Enumeration reducibility; Degree; Ershov Hierarchy; Incomparable degree; Arithmetical uniformity; Low; High; Cappable;
Short propositional refutations for dense random 3CNF formulas
Keywords: 68Q25; 03F20; 03F30; 03D15; Propositional proof complexity; Random 3-SAT; Refutation algorithms; Threshold logic; Frege proofs;
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
Keywords: 68Q17; 03D15; 03F25; 03F30Proof complexity; Bounded arithmetic; Search problems; Finite games; Computational complexity; Equilibria
The provably terminating operations of the subsystem PETJ of explicit mathematics
Keywords: 03D15; 03D75; 03H15; Explicit mathematics; Polytime functions; Non-standard models;
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Keywords: 03C60; 03D15; Computation; Unit-cost; Bit-cost; P vs. NP; Ordered abelian semi-group; Axioms; Products of rings; Polynomial hierarchy; Arithmetic hierarchy;
A complete complexity classification of the role assignment problem
Keywords: 05C15; 03D15; Computational complexity; Graph homomorphism; Role assignment;
Context-free languages can be accepted with absolutely no space overhead
Keywords: 03D15; 68Q05; 68Q15; 68Q42; 68Q45; Context-free languages; Deterministic context-free languages; Editing Turing machines; In-place algorithms; Linear space; Overhead-free computation; Restarting automata; RRW-automata; Space overhead; Space reuse; Two-sta
P=NP for some structures over the binary words
Keywords: 68Q15; 68Q05; 68Q10; 03D15; 03C10; Computability over structures; Computational complexity; Complexity classes; Polynomial-time computability; P versus NP; Relativization;
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;
On the expressiveness and decidability of o-minimal hybrid systems
Keywords: 68Q60; 03C64; 03D15; Hybrid system; O-minimality; BSS-model of computation; Bisimulation; Definability; Decidability;
The complexity of finite model reasoning in description logics
Keywords: 03B70; 03D15; 68Q17; Description logic; Finite satisfiability; Number restrictions;