| | |
Summary: Isolation, Matching, and Counting:
Uniform and Nonuniform Upper Bounds
Eric Allendery
Department of Computer Science, Rutgers University
Piscataway, NJ 08855, USA
e-mail: allender@cs.rutgers.edu
Klaus Reinhardtz
Wilhelm-Schickard Institut fur Informatik
Universitat Tubingen
Sand 13, D-72076 Tubingen, Germany
e-mail: reinhard@informatik.uni-tuebingen.de
Shiyu Zhoux
Department of Computer and Information Science
University of Pennsylvania
Philadelphia, PA 19104, USA
e-mail: shiyu@cis.upenn.edu
Abstract
We show that the perfect matching problem is in the complexity class SPL in the
nonuniform setting. This provides a better upper bound on the complexity of the
matching problem, as well as providing motivation for studying the complexity
|
