Results 281 to 290 of about 828,043 (333)

Cognitive modeling of real-world behavior for understanding mental health. [PDF]

Trends Cogn Sci
Mirea DM, Nook EC, Niv Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Progress in Computational Complexity Theory

Journal of Computer Science and Technology, 2005
We briefly survey a number of important recent achievements in Theoretical Computer Science (TCS), especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph ...
Jin-Yi Cai, Hong Zhu
openaire   +1 more source

Computational Complexity Theory

2004
Week One: Complexity theory: From Godel to Feynman Complexity theory: From Godel to Feynman History and basic concepts Resources, reductions and P vs. NP Probabilistic and quantum computation Complexity classes Space complexity and circuit complexity Oracles and the polynomial time hierarchy Circuit lower bounds "Natural" proofs of lower bounds ...
openaire   +1 more source

Complexity of Categorical Theories with Computable Models

Algebra and Logic, 2004
The main results of the article are as follows: Theorem 1. For each natural number \(n\geq 1\), there exists an \(\aleph_1\)-categorical theory \(T\) of finite signature such that (1) the Turing degree of \(T\) equals \(\mathbf{0}^{(n)}\); (2) \(T\) has a computable model; (3) all countable models of \(T\) have computable isomorphic copies; (4) \(T ...
Goncharov, S. S., Khusainov, B. Kh.
openaire   +2 more sources

Computational Complexity Theory

1989
Overview of computational complexity theory by J. Hartmanis The isomorphism conjecture and sparse sets by S. R. Mahaney Restricted relativizations of complexity classes by R. V. Book Descriptive and computational complexity by N. Immerman Complexity issues in cryptography by A. L. Selman Interactive proof systems by S. Goldwasser.
openaire   +1 more source

Complexity problems in computational theory

Russian Mathematical Surveys, 1981
CONTENTS Introduction Chapter I. Methods of general computability theory in complexity bounds § 1. Complexity hierarchies. Complexity in finite domains § 2. Exponential and high lower bounds § 3. Complexity classes. Universal problems Chapter II. Methods and techniques for constructing "fast" algorithms § 1. Identification of subwords of a given word §
openaire   +2 more sources

Intrinsic theories and computational complexity

1995
We introduce a new proof theoretic approach to computational complexity. With each free algebra \(\mathbb{A}\)we associate a first order “intrinsic theory for \(\mathbb{A}\)”, IT (\(\mathbb{A}\)), with no initial functions other than the constructors of \(\mathbb{A}\), and no axioms for them other than the generative and inductive axioms, which ...
openaire   +1 more source

Computational Complexity and Recursion Theory

2010
A general axiomatic approach to computational complexity was formulated by Blum [1]. His work was greatly influenced by the work of Rabin [23] and served to generalize to all complexity measures, results derived by Hartmanis and Sterns [8] for Turing machine computation times.
openaire   +1 more source

Computational Information Theory: Bridging Shannon's Information Theory and Computational Complexity

We develop Computational Information Theory as a comprehensive bridge between Claude Shannon’s classical information theory and computational complexity theory. Shannon’s framework addresses communication, data compression, and channel capacity, while complexity theory focuses on computational resources and problem difficulty.
openaire   +1 more source