◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Stephan

36 papers hereh-index 293.3k citations284 works total

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

author position
  • first author2
  • middle author10
  • last author23

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

fields
  • math.LO14
  • cs.CC6
  • cs.LO5
  • cs.FL3
  • cs.DS2
  • cs.GT2
same name
  • F. Stephan — 12 papers
  • F. Stephan — 8 papers, h 6
  • F. Stephan — 7 papers, h 28
  • F. Stephan — 3 papers, h 8
  • F. Stephan — 2 papers, h 7
  • F. Stephan — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072022
most citedKolmogorov complexity and the Recursion Theorem

76 citations · 207 across the 31 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

cs.CC2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT

Gordon Hoi, Sanjay Jain, Frank Stephan

X3SAT is the problem of whether one can satisfy a given set of clauses with up to three literals such that in every clause, exactly one literal is true and the others are false. A…

math.LO2019

On the order dimension of locally countable partial orderings

Kojiro Higuchi, Steffen Lempp, Diip Raghavan +1

We show that the order dimension of the partial order of all finite subsets of κ under set inclusion is log2​(log2​(κ)) whenever κ is an infinite cardinal. We also…

math.LO2019★ 1 cited

Randomness and initial segment complexity for probability measures

Andre Nies, Frank Stephan

We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure μ on the space of infinite bit sequences is ML absolutely continuous if…

cs.LO2019

Random Subgroups of Rationals

Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov +4

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup (G,+) of rationals, two main…

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