Treffer: A very hard log-space counting class
Title:
A very hard log-space counting class
Authors:
Source:
Structure in complexity theoryTheoretical computer science. 107(1):3-30
Publisher Information:
Amsterdam: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 32 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Automate fini, Finite automaton, Autómata estado finito, Complexité calcul, Computing complexity, Complejidad cálculo, Fonction logarithmique, Logarithmic function, Función logarítmica, Informatique théorique, Computer theory, Informática teórica, Machine Turing, Turing machine, Máquina Turing, Problème NP complet, NP complete problem, Problema NP completo, Système informatique, Computer system, Sistema informático, Temps polynomial, Polynomial time, Tiempo polinomial, Transducteur, Transducer, Transductor
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. politèc. Catalunya, dep. LSI, 08028 Barcelona, Spain
ISSN:
0304-3975
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4666381
Database:
PASCAL Archive
Weitere Informationen
We consider the logarithmic-space counting and optimization classes #75L, span-L, and opt-L, which are defined analogously to their polynomial-time counterparts. We obtain complete functions for these three classes in terms of graphs and finite automata. We show that #75L and opt-L are both included in NC2, but that, surprisingly, span-L seems to be a much harder class than #75L and opt-L. We demonstrate that span-L functions can be computed in polynomial time if and only if P (#75P) and all the classes of the polynomial-time hierarchy are included in P.