Keywords: نظریه محاسبات; Arithmetic circuits; Reductions; p-projection; c-reduction; Hamiltonian cycle polynomial; Theory of computation; Computational complexity;
مقالات ISI نظریه محاسبات (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: نظریه محاسبات; Term rewriting systems; Post Correspondence Problem; Theory of computation;
Keywords: نظریه محاسبات; Theory of computation; Proof complexity; Cutting planes;
Keywords: نظریه محاسبات; Parallel processing; Sorting networks; Theory of computation;
Keywords: نظریه محاسبات; Formal languages; Theory of computation; Algorithms;
Keywords: نظریه محاسبات; Algorithmic game theory; Facility location; Graph algorithms; Price of anarchy; Theory of computation;
Keywords: نظریه محاسبات; Petri nets; Open nets; Conformance; Theory of computation;
Keywords: نظریه محاسبات; Arbitrary number; Random Access Machine; Arithmetic complexity; Computational complexity; Theory of computation;
Keywords: نظریه محاسبات; Analysis of algorithms; Automatic theorem proving; Computational geometry; Distributed computing; Theory of computation
Keywords: نظریه محاسبات; DFT matrix; Theory of computation; Commutativity of matrices
Keywords: نظریه محاسبات; Theory of computation; Formal languages; Computational complexity; Decision problems; Infinite Post Correspondence Problem; Exact complexity; Î 10-complete;
Keywords: نظریه محاسبات; Theory of computation; Small-set expansion; Modularity clustering; Social network
Keywords: نظریه محاسبات; Lattices; Lattices of subsets of N; Formal languages; Theory of computation; Regular subsets of N; Closure properties;
Keywords: نظریه محاسبات; Theory of computation; Pattern; Regular tree language; Tree automaton; Tree homomorphism
Keywords: نظریه محاسبات; Analysis of algorithms; Computational complexity; Randomized algorithms; Theory of computation
Keywords: نظریه محاسبات; Concurrency; Theory of computation; Petri nets; Home states
Keywords: نظریه محاسبات; Locally Testable Codes; Unique Games Conjecture; Computational complexity; Theory of computation
Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2
Keywords: نظریه محاسبات; Theory of computation; Covering radius; Repetition codes; Simplex codes; MacDonald codes;
Limit-depth and DNR degrees
Keywords: نظریه محاسبات; Theory of computation; Logical depth; Kolmogorov complexity;
Cliques enumeration and tree-like resolution proofs
Keywords: نظریه محاسبات; Theory of computation; Resolution; Clique; Decision tree;
A note about k-DNF resolution
Keywords: نظریه محاسبات; Theory of computation; Proof complexity; k-DNF; Resolution;
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis
Keywords: نظریه محاسبات; Theory of computation; Proof complexity; Resolution; Strong Exponential Time Hypothesis;
A generalization of extension complexity that captures P
Keywords: نظریه محاسبات; Combinatorial problems; Computational complexity; Theory of computation; Polytopes; Extended formulations; Extension complexity; Lower bounds; Linear programming;
On Martin-Löf (non-)convergence of Solomonoff's universal mixture
Keywords: نظریه محاسبات; Solomonoff induction; Kolmogorov complexity; Theory of computation
Undecidability of accordance for open systems with unbounded message queues
Keywords: نظریه محاسبات; Petri nets; Open nets; Accordance preorder; Theory of computation
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
Keywords: نظریه محاسبات; Theory of computation; Davis–Putnam–Robinson–Matiyasevich theorem; Diophantine equation with a finite number of solutions; Matiyasevichʼs conjecture on finite-fold Diophantine representations
LP decoding of codes with expansion parameter above 2/3
Keywords: نظریه محاسبات; Combinatorial problems; Theory of computation; Error-correcting codes; LP decoding; Expander codes
Boundary properties of the satisfiability problems
Keywords: نظریه محاسبات; Theory of computation; NP-completeness; Satisfiability; Boundary properties of graphs
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
Keywords: نظریه محاسبات; Modal logic; Counting quantifiers; Computational complexity; Tiling problem; Finite model property; Theory of computation
Analogues of Chaitinʼs Omega in the computably enumerable sets
Keywords: نظریه محاسبات; Theory of computation; Kolmogorov complexity; Computably enumerable sets; Completeness
A K-trivial set which is not jump traceable at certain orders
Keywords: نظریه محاسبات; Algorithmic randomness; K-triviality; Jump traceability; Theory of computation
On the rectangle method in proofs of robustness of tensor products
Keywords: نظریه محاسبات; Theory of computation; Locally testable codes; LTC; Robustness; Robust; Tensor product; Product code
On the inapproximability of maximum intersection problems
Keywords: نظریه محاسبات; Approximation algorithm; Theory of computation; Inapproximability; Maximum intersection; Disclosure control
The tensor product of two good codes is not necessarily robustly testable
Keywords: نظریه محاسبات; Theory of computation; Locally testable codes; Robust; Robustness; Tensor product; Product code
Universal map for cellular automata
Keywords: نظریه محاسبات; Theory of computation; Mathematical results; Complexity; Dynamics;
Paired-bacteria optimiser – A simple and fast algorithm
Keywords: نظریه محاسبات; Design of algorithms; Theory of computation; Pseudo gradient; Quorum sensing; Optimisation
Learning a subclass of k-quasi-Horn formulas with membership queries
Keywords: نظریه محاسبات; Query learning; Boolean formulas; Theory of computation
Boundedness of adaptive nets is decidable
Keywords: نظریه محاسبات; Adaptive nets; Boundedness; Decidability; Theory of computation
Permuted function matching
Keywords: نظریه محاسبات; Approximate pattern matching; Multiple knapsack problems; Approximation algorithms; Theory of computation
A new family of nonstochastic languages
Keywords: نظریه محاسبات; Theory of computation; Nonstochastic languages;
Nonadaptive quantum query complexity
Keywords: نظریه محاسبات; Quantum computing; Quantum query complexity; Decision tree complexity; Theory of computation
Regular patterns, regular languages and context-free languages
Keywords: نظریه محاسبات; Theory of computation; Pattern languages; Regular languages; Context free languages
Constructive dimension equals Kolmogorov complexity
Keywords: نظریه محاسبات; Constructive dimension; Kolmogorov complexity; Levin's universal semi-measure; Theory of computation;
Exponential separation between Res(k) and Res(k+1) for k⩽Élogn
Keywords: نظریه محاسبات; Propositional proof complexity; Lower bounds; k-DNFs; Resolution; Res(k); Switching lemmas; Random restrictions; Theory of computation; Computational complexity;
The 2004 Benjamin Franklin Medal in Computer and Cognitive Science presented to Richard M. Karp
Keywords: نظریه محاسبات; Computational complexity; Polynomial time algorithms; Theory of computation; NP-completeness; Combinatorial problems;