1169 search results - page 33 / 234 » Degrees of monotone complexity |
DNA
2006
Springer
14 years 12 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
CSR
2006
Springer
14 years 12 days ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We determine set-theoretic defining equations for the variety Dualk,d,N P(Sd CN ) of hypersurfaces of degree d in CN that have dual variety of dimension at most k. We apply these ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...