# Computational Complexity

29,322 Followers

Recent papers in

**Computational Complexity**1 Department of Computer Engineering, Chonnam National university 300 Yongbong-dong, Buk-gu, Gwangju 500-757, Korea hthieu@hcmut.edu.vn, ykwon@chonnam.ac.kr 2 Dicision of Bionics and Bioinformatics, Chonbuk National University 664-14 St.... more

We propose in this article a unified approach to functional estimation problems based on possibly censored data. The general framework that we define allows, for instance, to handle density and hazard rate estimation based on randomly... more

The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is played by two players, MAX and MIN, on a directed multigraph,... more

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic... more

We provide two algorithms for computing the volume of the convex polytope Ω : = { x ∈ ℝ n + | Ax ≤ b }, for A , ∈ ℝ m × n , b ∈ ℝ n . The computational complexity of both algorithms is essentially described by n m , which makes them... more

Η συνάντηση Επιστήμης και Φιλοσοφίας στην Τέχνη: Η περίπτωση του θεατρικού έργου Χ Alan Turing

Διημερίδα με θέμα:

«Φιλοσοφία και Επιστήμη. Μία διαχρονική συνάντηση»

1 Δεκεμβρίου-2 Δεκεμβρίου 2018

Διημερίδα με θέμα:

«Φιλοσοφία και Επιστήμη. Μία διαχρονική συνάντηση»

1 Δεκεμβρίου-2 Δεκεμβρίου 2018

This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the same signal is decoded-and-forwarded to the destination over N time... more

This paper proposes a Hierarchical Evolutionary-Deterministic Algorithm (HEDA) for designing square grounding grids. This algorithm performs the design by means of a hierarchical coupling of a real coded evolutionary algorithm and the... more

The progress in the field of computers in addition to improving our lives, is also helping to better understand the universe . Understanding the logic of computing and information is changing the way we look at the universe from the... more

We first advocate that the AUML (Agent Unified Modeling Language) notation, even in its new version, is not precise enough to adequately describe protocols. This problem was long identified by Harel and we propose to follow his solution:... more

We show that if a polynomial filled Julia set has empty interior, then it is computable.