◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Stefan S. Dantchev

7 papers hereh-index 9293 citations50 works total

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

author position
  • first author7

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

fields
  • cs.LO4
  • cs.CC2
  • cs.IT1

identity via Semantic Scholar / OpenAlex

activity
20122021
most citedResolution and the binary encoding of combinatorial principles

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

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.CC2021★ 1 cited

Depth lower bounds in Stabbing Planes for combinatorial principles

Stefan Dantchev, Nicola Galesi, Abdul Ghani +1

Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequal…

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