Results 91 to 100 of about 1,491,574 (265)
A new perspective on computational complexity theory in Membrane Computing [PDF]
, 2019 A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework of membrane computing, a \solution" to an abstract decision problem consists of a family of membrane systems (where each ...
Orellana Martín, David +4 more
core
On the Constant-Depth Circuit Complexity of Generating Quasigroups [PDF]
TheoretiCSWe investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum Generating Set Problem (MGS), and Sub(quasi)group Membership Problem (Membership) for groups and quasigroups (=Latin squares), given as input in terms of their ...
Nathaniel A. Collins +3 more
doaj +1 more source
Turing's algorithmic lens: from computability to complexity theory
Arbor: Ciencia, Pensamiento y Cultura, 2013 [EN]: The decidability question, i.e., whether any mathematical statement could be computationally proven true or false, was raised by Hilbert and remained open until Turing answered it in the negative. Then, most efforts in theoretical computer science turned to complexity theory and the need to classify decidable problems according to their ...
Díaz Cort, Josep, Torras, Carme
openaire +5 more sources
A novel perturbation based compression complexity measure for networks
Heliyon, 2019 Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness.
Mohit Virmani, Nithin Nagaraj
doaj +1 more source
Parametrised second-order complexity theory with applications to the study of interval computation [PDF]
, 2019 Eike Neumann, Florian Steinberg
openalex +1 more source
Sensors, 2018 In estimating the two-dimensional (2D) direction-of-arrival (DOA) using a coprime planar array, the main issues are the high complexity of spectral peak search and the limited degree of freedom imposed by the number of sensors.
Haiyun Xu +4 more
doaj +1 more source
Theories with self-application and computational complexity
Information and Computation, 2003 The author gives a very elegant and uniform characterization of various complexity classes -- namely FPtime, FPtimeLinspace, FPspace, and FLinspace -- in the context of Feferman's explicit mathematics [``Constructive theories of functions and classes'', Logic colloquium '78, Stud. Logic Found. Math. 97, 159--224 (1979; Zbl 0441.03022)]. It makes use of
openaire +2 more sources
Arithmetic theories for computational complexity problems
Information and Control, 1986 Ein Ansatz zum genaueren Verständnis der Hierarchie von Komplexitätsklassen besteht darin, eine ''Übersetzung'' der komplexitätstheoretischen Probleme in entsprechende logische Probleme zu finden. Die Autoren verallgemeinern eine solche Konstruktion von R. A. DeMillo und R. J. Lipton (1979) und geben eine Reihe von Anwendungen an.
Homer, Steve, Reif, John
openaire +1 more source
Time-memory trade-offs for index calculus in genus 3
Journal of Mathematical Cryptology, 2015 In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj +1 more source
Multiuser detection using evolutionary and local search heuristic algorithms
Semina: Ciências Exatas e Tecnológicas, 2004 The characteristics of the main heuristic algorithms based on genetic evolution theory and local search, applied to a DS/CDMA multi-user detection problem in Flat Rayleigh fading channel, are shown.
Paul Jean Etienne Jeszensky +2 more
doaj