◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Makowsky

11 papers hereh-index 284.3k citations197 works total

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

author position
  • sole author2
  • first author2
  • middle author2
  • last author5

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

fields
  • math.CO4
  • cs.CC1
  • cs.CY1
  • cs.LG1
  • cs.LO1
  • math.HO1

identity via Semantic Scholar / OpenAlex

activity
20062020
most citedThe quantum FFT can be classically simulated

40 citations · 48 across the 6 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

cs.CY2015★ 3 cited

Teaching Logic for Computer Science: Are We Teaching the Wrong Narrative?

Johann Makowsky

In this paper I discuss what, according to my long experience, every computer scientist should know from logic. We concentrate on issues of modeling, interpretability and levels of…

cs.LO2015

Efficient computation of generalized Ising polynomials on graphs with fixed clique-width

Tomer Kotek, Johann A. Makowsky

Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast…

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