1795 search results - page 216 / 359 » On the Complexity of Circuit Satisfiability |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
DCG
2010
13 years 10 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
DEBU
2008
13 years 10 months ago
2008
Database administrators struggle when managing workloads that have widely different performance requirements. For example, the same database may support short-running OLTP queries...
DAM
2006
13 years 10 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...