A Very Hard log-Space Counting Class

@article{lvarez1993AVH,
  title={A Very Hard log-Space Counting Class},
  author={C. {\`A}lvarez and Birgit Jenner},
  journal={Theor. Comput. Sci.},
  year={1993},
  volume={107},
  pages={3-30}
}
Abstract We consider the logarithmic-space counting and optimization classes #L, 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 #L and opt-L are both included in NC 2 , but that, surprisingly, span-L seems to be a much harder class than #L and opt-L. We demonstrate that span-L functions can be computed in polynomial time if and only if P (#P) and all… Expand
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
TLDR
This work investigates the complexity of three fundamental algorithmic problems for two simple yet general complexity classes, based on logspace Turing machines, and proves constant delay enumeration, and both counting and uniform generation of solutions in polynomial time. Expand
On the Connection between Interval Size Functions and Path Counting
TLDR
This work defines a new class of interval size functions which strictly contains FP and is strictly contained in TotP under reasonable complexity-theoretic assumptions, and shows that this new class contains some hard counting problems. Expand
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
TLDR
This work solves the open problem of whether the fundamental problem #NFA admits an FPRAS, and obtains as a welcome corollary that every function in SpanL admits a fully polynomial-time randomized approximation scheme (FPRAS). Expand
Semantical Counting Circuits
TLDR
This work considers semantically defined probabilistic complexity classes corresponding to AC0 and NC1 and proves that in the case of unbounded error, they are identical to their syntactical counterparts. Expand
On the connection between interval size functions and path counting
TLDR
This work provides inclusion and separation relations between TotP and interval size counting classes, and defines a new class of interval size functions which strictly contains FP and is strictly contained in TotP under reasonable complexity-theoretic assumptions, and shows that this new class contains hard counting problems. Expand
On the power of unambiguity in log-space
TLDR
It is shown that counting the number of s-t paths in graphs where the numberof s-v paths for any v is bounded by a polynomial can be done in FUL: the unambiguous log-space function class. Expand
Descriptive Complexity for Counting Complexity Classes
TLDR
This paper obtains a logic called Quantitative Second Order Logics (QSO), and shows how some of its fragments can be used to capture fundamental counting complexity classes such as FP, #P and FPSPACE, among others. Expand
Descriptive Complexity for counting complexity classes
TLDR
This paper obtains a logic called Quantitative Second Order Logics (QSO), and shows how some of its fragments can be used to capture fundamental counting complexity classes such as FP, #P and FPSPACE, among others. Expand
On TC0, AC0, and Arithmetic Circuits
TLDR
A characterization of TC0 in terms of #AC0, as the class of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates, and a restatement of this characterization is that TC0 can be simulated by Constant-depth arithmetic circuits, with a single threshold gate. Expand
Complexity and Algorithms for Well-Structured k-SAT Instances
TLDR
The main result is that the computational complexity of SAT, MAX-SAT, #SAT grows smoothly with the diameter (as a function of the number of variables), while the running time of the algorithms matches previously known results. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Space-Bounded Hierarchies and Probabilistic Computations
TLDR
It is demonstrated that any language recognizable by an alternating Turing machine in log n space with a constant number of alternations also can be recognized by a space-bounded spacebounded probabilistic Turing machine with small error probability. Expand
Two Applications of Inductive Counting for Complementation Problems
TLDR
It is shown that small numbers of “role switches” in two- person pebbling can be eliminated and a general result that shows closure under complementation of classes defined by semi-unbounded fan-in circuits is shown. Expand
On Counting and Approximation
We introduce a new class of functions, called span functions which count the different output values that occur at the leaves of the computation tree associated with a nondeterministic polynomialExpand
A Taxonomy of Problems with Fast Parallel Algorithms
  • S. Cook
  • Mathematics, Computer Science
  • Inf. Control.
  • 1985
TLDR
An attempt is made to identify important subclasses of NC and give interesting examples in each subclass, and a new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph. Expand
Space-Bounded Reducibility among Combinatorial Problems
  • N. Jones
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1975
TLDR
Two versions of the polynomial time-reducibility of Cook and Karp are defined, by means of Turing machines and by bounded-quantifier formulas, and they are shown to be complete for nondeterministic (deterministic) log n space. Expand
The Complexity of Optimization Problems
  • M. Krentel
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1988
TLDR
It is shown that TRAVELING SALESPERSON and KNAPSACK are complete for OptP, and that CLIQUE and COLORING arecomplete for a subclass of OptP . 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
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
TLDR
It is shown that for the one-way $\log n$-tape automata the nondeterministic model (1-NL) is computationally much more powerful than the deterministic model(1-L), that under one- way $\logn$-Tape reductions there exist natural complete languages for these automata and that the complete languages cannot be sparse. Expand
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
TLDR
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems. Expand
The polynomial-time hierarchy and sparse oracles
TLDR
It is proved that the polynomial-time hierarchy collapses if and only if for every sparse set S, the hierarchy relative to S collapses and the question is answered if it is answered for any arbitrary sparse oracle set. Expand
...
1
2
3
...