2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CC2017★ 1 cited
On the Approximation Method and the P versus NP Problem
Norbert Blum
First of all we give some reasons that "natural proofs" built not a barrier to prove P NP using Boolean complexity. Then we investigate the approximation method for its ext…
cs.FL2015
On LR(k)-parsers of polynomial size
Norbert Blum
Usually, a parser for an -grammar is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string .…
cs.DS2015★ 2 cited
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited
Norbert Blum
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…