◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Marzio De Biasi

4 papers hereh-index 428 citations10 works total

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

author position
  • sole author2
  • first author2

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

fields
  • cs.CC3
  • cs.FL1

identity via Semantic Scholar / OpenAlex

activity
20132017
collaborators
Showing 2014Show all

2 papers · 1 filter

cs.CC2014

Permutation Reconstruction from Differences

Marzio De Biasi

We prove that the problem of reconstructing a permutation π1​,…,πn​ of the integers [1…n] given the absolute differences ∣πi+1​−πi​∣, i=1,…,n−1 is NP-co…

cs.CC2014

Minimal TSP Tour is coNP-Complete

Marzio De Biasi

The problem of deciding if a Traveling Salesman Problem (TSP) tour is minimal was proved to be coNP-complete by Papadimitriou and Steiglitz. We give an alternative proof based on a…

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