◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jakob Nordstr”öm

4 papers here

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

author position
  • middle author2
  • last author2

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

fields
  • cs.CC2
  • cs.AI1
  • math.OC1
ORCID 0000-0002-2700-4285

identity via Semantic Scholar / OpenAlex

activity
20102025
most citedUnderstanding Space in Proof Complexity: Separations and Trade-offs via Substitutions

14 citations · 15 across the 4 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2025

Pseudo-Boolean Proof Logging for Optimal Classical Planning

Simon Dold, Malte Helmert, Jakob Nordström +2

We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified…

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