◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hiroki Morizumi

1 paper here

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

author position
  • sole author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedA Note on the Inversion Complexity of Boolean Functions in Boolean Formulas

7 citations · 7 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2008★ 7 cited

A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas

Hiroki Morizumi

In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in…

◍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.