Optimal series-parallel trade-offs for reducing a function to its own graph

Authors:
Richard Beigel;Lane A. Hemaspaandra;Harald Hempel;Jörg Vogel
Affiliations:
Temple Univ., Princton, New Jersy;Univ. of Rochester, Rochester, New York;Friedrich-Schiller-Univ. Jena, Jena, Germany;Friedrich-Schiller-Univ. Jena, Jena, Germany
Venue:
Information and Computation
Year:
2002

Citing 13
Cited 0

The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Enumerative counting is hard

Information and Computation
Bounded query classes

SIAM Journal on Computing
A note on enumerative counting

Information Processing Letters
Bounded queries to SAT and the Boolean hierarchy

Theoretical Computer Science
Bounded reductions

Complexity theory
Promises and fault-tolerant database access

Complexity theory
A taxonomy of complexity classes of functions

Journal of Computer and System Sciences
Approximable sets

Information and Computation
Polynomial-time Membership Comparable Sets

SIAM Journal on Computing
Quasi-linear truth-table reductions to p-selective sets

Theoretical Computer Science
Comparison Between the Complexity of a Function and the Complexity of Its Graph

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On finding the number of graph automorphisms

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of computing a function given only an oracle for its graph. For this problem, we present optimal trade-offs between serial and parallel queries. In particular, we give a fuction for which parallel access to its own graph is exponentially more expensive than sequential access.