Results 101 to 110 of about 1,491,574 (265)

Model Theory and Computational Complexity

open access: yes, 1997
Model theory has lately become a domain of interest to computer scientists. The reason is that model theory, and in particular its restriction to finite models, has led to some new results in computational complexity (e.g. NLOGSPACE=co-NLOGSPACE). In this report, firstly we present a survey of this theory and we focus on the descriptive complexity ...
Lafitte, Grégory, Mazoyer, Jacques
openaire   +1 more source

Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time

open access: yesInformatika, 2018
A problem to describe the complexity class BPP in terms of a logical language is considered. BPP (abbreviation for bounded-error probablistic polynomial time) represents the class of computational decision problems that are efficiently solvable in ...
V. G. Naidenko
doaj  

Coding Methods in Computability Theory and Complexity Theory

open access: yes, 2013
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees, it has been used to determine the complexity of the elementary theory, to provide restrictions on automorphisms ...
openaire   +2 more sources

Editorial: Brain connectivity, dynamics, and complexity

open access: yesFrontiers in Human Neuroscience, 2023
Stephen José Hanson   +1 more
doaj   +1 more source

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data [PDF]

open access: green, 2018
Akitoshi Kawamura   +3 more
openalex   +1 more source

Home - About - Disclaimer - Privacy