◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Norbert Blum

3 papers hereh-index 11774 citations38 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.CC1
  • cs.DS1
  • cs.FL1

identity via Semantic Scholar / OpenAlex

most citedMaximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.