Marco Protasi

发表

Probabilistic Models for Database Schemes and Random Hypergraphs

Maurizio Talamo, Giorgio Ausiello, Marco Protasi, 1983, WG.

An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests

Giorgio Gambosi, Maurizio Talamo, Marco Protasi, 1989, FSTTCS.

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems

Giorgio Ausiello, Marco Protasi, Alberto Marchetti-Spaccamela, 1979, Theor. Comput. Sci..

Reactive Local Search for the Maximum Clique Problem1

Roberto Battiti, Marco Protasi, R. Battiti, 2001, Algorithmica.

A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs

Maurizio Talamo, Marco Protasi, 1986, RAIRO Theor. Informatics Appl..

Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)

Roberto Battiti, Marco Protasi, R. Battiti, 1999, Discret. Appl. Math..

Complexity and approximation: combinatorial optimization problems and their approximability properties

Giorgio Gambosi, Giorgio Ausiello, Marco Protasi, 1999 .

Reactive search, a history-sensitive heuristic for MAX-SAT

Roberto Battiti, Marco Protasi, R. Battiti, 1997, JEAL.

An efficient algorithm for the binary classification of patterns using MLP-networks

Marco Protasi, S. Fanelli, M. Di Martino, 1993, IEEE International Conference on Neural Networks.

On the Learnability of DNF Formulae

Marco Protasi, Alberto Marchetti-Spaccamela, Ludek Kucera, 1988, ICALP.

G.AUSIELLO, A.D'ATRI, M.PROTASI (1977)On the structure of combinatoriat probtems and struoture preserving reductior:z.s,. 4th Int. ColI. on Automata,Languages andProgr'amming, Turku, (1977).

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1978 .

Structure Preserving Reductions among Convex Optimization Problems

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1980, J. Comput. Syst. Sci..

Reactive Search, a history-based heuristic for MAX-SAT

Roberto Battiti, Marco Protasi, R. Battiti, 1996 .

An efficient implicit data structure for relation testing and searching in partially ordered sets

Giorgio Gambosi, Maurizio Talamo, Marco Protasi, 1993, BIT.

Complexity and Approximation

Giorgio Gambosi, Giorgio Ausiello, Marco Protasi, 1999, Springer Berlin Heidelberg.

Preserving Approximation in the Min-Weighted Set Cover Problem

Giorgio Gambosi, Maurizio Talamo, Marco Protasi, 1997, Discret. Appl. Math..

On Learning Monotone DNF Formulae under Uniform Distributions

Marco Protasi, Alberto Marchetti-Spaccamela, Ludek Kucera, 1994, Inf. Comput..

Local Search, Reducibility and Approximability of NP-Optimization Problems

Giorgio Ausiello, Marco Protasi, G. Ausiello, 1995, Inf. Process. Lett..

Lattice theoretic ordering properties for NP-complete optimization problems

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1981, Fundam. Informaticae.

Full Approximatibility of a Class of Problems over Power Sets

Giorgio Ausiello, Marco Protasi, Alberto Marchetti-Spaccamela, 1981, CAAP.

Solving MAX-SAT with non-oblivious functions and history-based heuristics

Roberto Battiti, Marco Protasi, R. Battiti, 1996, Satisfiability Problem: Theory and Applications.

A Characterization of Reductions among Combinatorial Problems

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1981 .

On the Maximum Size of Random Trees

Maurizio Talamo, Marco Protasi, 1985, TAPSOFT, Vol.1.

Theoretical Computer Science Approximate Solution of Np Optimization Problems *

Giorgio Ausiello, Marco Protasi, Pierluigi Crescenzi, 2022 .

The Largest Tree in a Random Graph

Marco Protasi, Alberto Marchetti-Spaccamela, 1983, Theor. Comput. Sci..

On the Comparison of Notions of Approximation

Giorgio Ausiello, Marco Protasi, G. Ausiello, 1975, MFCS.

Classes of Structurally Isomorphic {NP}-Optimization Problems

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1977, MFCS.

Limiting Characterizations of Low Level Space Complexity Classes

Marco Protasi, Michele Angelaccio, 1993, RAIRO Theor. Informatics Appl..

Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent

Marco Protasi, Marco Gori, Monica Bianchini, 1997, ICONIP.

Exploring and comparing the best "direct methods" for the efficient training of MLP-networks

Marco Protasi, Stefano Fanelli, M. Di Martino, 1996, IEEE Trans. Neural Networks.

On the Number of Arithmetical Operations for Finding Fibonacci Numbers

Maurizio Talamo, Marco Protasi, 1989, Theor. Comput. Sci..

On the Structure of Combinatorial Problems and Structure Preserving Reductions

Giorgio Ausiello, Marco Protasi, Alessandro D'Atri, 1977, ICALP.

Limiting Polynomial Approximation of Complexity Classes

Giorgio Ausiello, Marco Protasi, 1990, Int. J. Found. Comput. Sci..

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs

Maurizio Talamo, Marco Protasi, Alberto Marchetti-Spaccamela, 1986, MFCS.

A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems

Maurizio Talamo, Marco Protasi, M. Protasi, 1983, FCT.

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems

Giorgio Ausiello, Marco Protasi, Alberto Marchetti-Spaccamela, 1981, FCT.

Learning Under Uniform Distribution

Marco Protasi, Alberto Marchetti-Spaccamela, A. Marchetti-Spaccamela, 1989, FCT.

Approximation Preserving Reductions

Giorgio Gambosi, Giorgio Ausiello, Marco Protasi, 1999 .

Approximate Algorithms and Heuristics for MAX-SAT

Roberto Battiti, Marco Protasi, R. Battiti, 1998 .