Keywords: 47H10; 54E50; 54F05; 68N30; 68Q15; 68Q25Partial quasi-metric; 0-completeness; Fixed point; Recurrence equation; Running time of computing
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 03F03; 03F50; 03D15; 68Q15; Polytime computability; Applicative theories; Truth theories;
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
Permanent v. determinant: An exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture
Keywords: 68Q15; (20G05); Geometric Complexity Theory; Determinant; Permanent;
Propositional proofs and reductions between NP search problems
Keywords: 03B05; 03F07; 68Q15; Search problems; Nullstellensatz; Propositional proofs; Polynomial time reducibility;
A time lower bound for satisfiability
Keywords: 68Q10; 68Q15; 68Q25; Computational complexity; Lower bounds; Satisfiability;
Functions computable in polynomial space
Keywords: 68Q10; 68Q15; 68Q05; Polynomial space; Complexity class of functions; Bottleneck machines; Leaf languages; Arithmetic circuits; Straight-line programs;
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;
Separation results for the size of constant-depth propositional proofs
Keywords: primary; 03F20; secondary; 03F07; 68Q15; 68R99; Lengths of proofs; Propositional calculus; Frege system; Ordering 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;
Exact learning of DNF formulas using DNF hypotheses
Keywords: 06E30; 68Q15; 68Q20; 68Q25; 68T05; Computational learning theory; Disjunctive normal form; DNF; Boolean functions; Certificates; Algorithms; Complexity theory;