Corpus ID: 36686250

Using Randomness to Characterize the Complexity of Computation

@inproceedings{Hemaspaandra1989UsingRT,
  title={Using Randomness to Characterize the Complexity of Computation},
  author={L. A. Hemaspaandra and G. Wechsung},
  booktitle={IFIP Congress},
  year={1989}
}
Structural Complexity II
TLDR
This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity, addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained. Expand
Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
  • E. Allender
  • Computer Science
  • Complexity and Approximation
  • 2020
TLDR
In this brief informal reminiscence, the milieu of the early 1980’s that caused an up-welling of interest in resource-bounded Kolmogorov complexity is reviewed, and some more recent work is discussed that sheds additional light on the questions related to Kolmogoev complexity. Expand
Classes of bounded nondeterminism
TLDR
It is observed that these classes have complete problems and a characterization of the classes using robust machines with bounded access to the oracle is found, obtaining some other results in this direction. Expand
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph
TLDR
This work gives a fuction for which parallel access to its own graph is exponentially more expensive than sequential access, and presents optimal trade-offs between serial and parallel queries. Expand
Optimal Separations for Parallel versus Sequential Self-Checking: Parallelism Can Exponentially Incr
We provide optimal inclusions and separations between parallel and sequential self-checking, i.e., regarding the parallel and sequential reduction relationships between functions and their graphs. InExpand
An Introduction to Kolmogorov Complexity and Its Applications
  • Ming Li, P. Vitányi
  • Computer Science, Psychology
  • Texts and Monographs in Computer Science
  • 1993
TLDR
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. Expand
Collapsing Degrees via Strong Computation (Extended Abstract)
TLDR
It is shown that all <~L-complete sets for C collapse to a single _<~l "L degree, and that all<~NL-complete set for C are NL-isomorphic (and thus P- isomorphic), and the techniques also improve previous results for PSPACE. Expand
On the Complexity of Ranking
TLDR
This paper structurally characterizes the complexity of ranking and shows that even a type of approximate ranking, enumerative ranking, is hard unless P = P #P . Expand
Complexity Classes with Complete Problems Between P and NP-C
TLDR
It is observed that language classes located between P and NP have complete problems, and characterizations of these classes are found using robust machines with bounded access to the oracle, and in terms of nondeterministic complexity classes with polylog running time. Expand

References

SHOWING 1-10 OF 26 REFERENCES
On the Power of Parity Polynomial Time
This paper proves that the complexity class ⊕P, parity polynomial time [PZ83], contains the class of languages accepted by NP machines with few accepting paths. Indeed, ⊕P contains a broad class ofExpand
Bounded query computations
  • K. Wagner
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
TLDR
The main topics are: the relationship between the number of adaptive and parallel queries, connections to the closure of NP under polynomial-time truth-table reducibility, the Boolean hierarchy, the power of one more query, sparse oracles versus few queries, and natural complete problems for the most important bounded query classes. Expand
On truth-table reducibility to SAT and the difference hierarchy over NP
  • S. Buss, L. Hay
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
It is shown that polynomial-time truth-table reducibility by Boolean circuits to SAT is the same as log-space truth-table reducibility via Boolean formulas to SAT and the same as log-space TuringExpand
Structure of Complexity Classes: Separations, Collapses, and Completeness
During the last few years, unprecedented progress has been made in structural complexity theory; class inclusions and relativized separations were discovered, and hierarchies collapsed. We surveyExpand
The complexity of ranking
  • D. Huynh
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
It is shown that ranking languages accepted by one-way unambiguous auxiliary pushdown automata are in NC/sup (2)/. Negative results about ranking for several classes of simple languages are proved.Expand
The Difference and Truth-Table Hierarchies for NP
Definition de deux hierarchies des classes de complexite. Localisation de la hierarchie de differences et de la hierarchie du tableau de verite pour NP. Exemples d'ensembles complets dans les deuxExpand
Complexity and Structure
  • U. Schöning
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1986
TLDR
A comparison of circuit-size complexity and Probabilistic Algorithms for sparse sets and oracles shows that the former are superior to the latter in both the low and high hierarchies. Expand
The Complexity of Sparse Sets in P
  • E. Allender
  • Mathematics, Computer Science
  • Computational Complexity Conference
  • 1986
TLDR
The complexity of sparse sets in P is shown to be central to certain questions about circuit complexity classes and about one-way functions. Expand
The complexity of optimization problems
  • M. Krentel
  • Mathematics, Computer Science
  • STOC '86
  • 1986
TLDR
The central result is that any FPSAT function decomposes into an OptP function followed by polynomial-time computation, and it quantifies "how much" NP-completeness is in a problem, i.e., the number of NP queries it takes to compute the function. Expand
...
1
2
3
...