Sciweavers

468 search results - page 8 / 94
» One-Way Functions in Complexity Theory
Sort
View
CORR
2008
Springer
64views Education» more  CORR 2008»
14 years 11 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
90
Voted
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
15 years 5 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 8 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
109
Voted
CSCLP
2008
Springer
15 years 20 days ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
BMCBI
2007
157views more  BMCBI 2007»
14 years 11 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...