Patrizio Cintioli

According to our database, Patrizio Cintioli authored at least 10 papers between 1994 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Degrees of sets having no subsets of higher <i>m</i>- and tt-degree.

Patrizio Cintioli

Comput., 2021

2020

Corrigendum to "Sets with no subsets of higher weak truth-table degree", Reports on Mathematical Logic, 53 (2018).

Patrizio Cintioli

Reports Math. Log., 2020

2018

Sets with no subsets of higher weak truth-table degree.

Patrizio Cintioli

Reports Math. Log., 2018

2011

Low sets without subsets of higher many-one degree.

Patrizio Cintioli

Math. Log. Q., 2011

2005

Sets without Subsets of Higher Many-One Degree.

Patrizio Cintioli

Notre Dame J. Formal Log., 2005

2003

Polynomial Time Introreducibility.

Patrizio Cintioli, Riccardo Silvestri

Theory Comput. Syst., 2003

2001

The Helping Hierarchy.

Patrizio Cintioli, Riccardo Silvestri

RAIRO Theor. Informatics Appl., 2001

1997

Helping by Unambiguous Computation and Probabilistic Computation.

Patrizio Cintioli, Riccardo Silvestri

Theory Comput. Syst., 1997

Revisiting a Result of Ko.

Patrizio Cintioli, Riccardo Silvestri

Inf. Process. Lett., 1997

1994

Σ₁¹-Completeness of a Fragment of the Theory of Trees With Subtree Relation.

Patrizio Cintioli, Sauro Tulipani

Notre Dame J. Formal Log., 1994