Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Blum, Norbert"'
Autor:
Blum, Norbert
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the non-monotone com
Externí odkaz:
http://arxiv.org/abs/1708.03486
Autor:
Blum, Norbert
The Boston Iron Range forms part of a steeply folded Archean supracrustal volcano - sedimentary assemblage in the Abitibi Greenstone Belt. Horizons of Algoman type oxide facies iron formation and enclosing volcanics in the Adams Mine area are situate
Externí odkaz:
http://hdl.handle.net/11375/5810
Autor:
Blum, Norbert
Usually, a parser for an $LR(k)$-grammar $G$ is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string $x \in L(G)$. The best known upper bound for the size of such a parser is $O(2^{|G||
Externí odkaz:
http://arxiv.org/abs/1511.05770
Autor:
Blum, Norbert
We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting is equival
Externí odkaz:
http://arxiv.org/abs/1509.04927
Autor:
Blum, Norbert, Koch, Robert
Publikováno v:
In Information and Computation 10 April 1999 150(1):112-118
