In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic spaceâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Victor Lagerkvist
- Inf. Process. Lett.
- 2014

Universal algebra has proven to be a useful tool in the study of constraint satisfaction problems (CSP) since the complexity, upâ€¦Â (More)

Is this relevant?

2007

2007

- Jacobo TorÃ¡n
- Theory of Computing Systems
- 2007

We show that several reducibility notions coincide when applied to the Graph Isomorphism (GI) problem. In particular we show thatâ€¦Â (More)

Is this relevant?

2005

2005

- Zdenek Sawa, Petr Jancar
- Computers and Artificial Intelligence
- 2005

The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsumingâ€¦Â (More)

Is this relevant?

1996

1996

- Iain A. Stewart
- Discrete Applied Mathematics
- 1996

We show that the problems of deciding whether an arbitrary graph has a k-regular subgraph, for some given k 3; of decidingâ€¦Â (More)

Is this relevant?

1996

1996

- Jin-Yi Cai, Ashish V. Naik, D. Sivakumar
- STACS
- 1996

Recently a 1978 conjecture by Hartmanis [Har78] was resolved [CS95], following progress made by [Ogi95]. It was shown that thereâ€¦Â (More)

Is this relevant?

1995

1995

- Ioan I. Macarie
- STACS
- 1995

We investigate hierarchical properties and log-space reductions of languages recognized by log-space probabilistic Turingâ€¦Â (More)

Is this relevant?

1991

1991

- Iain A. Stewart
- Mathematical systems theory
- 1991

In this paper we investigate the logics obtained by augmenting first-order logic (with successor) with operators corresponding toâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Helmut Seidl
- STACS
- 1989

We s h o w : f o r mJe~j constant m i t can be decided i n p o l y n o m i a l t ime whether or not two m-ambiguous finite treeâ€¦Â (More)

Is this relevant?

1989

1989

- Ernst W. Mayr, Ashok Subramanian
- Structure in Complexity Theory Conference
- 1989

We develop a method for non-trivially restricting fanout in a circuit. We study the complexity of the Circuit Value problem and aâ€¦Â (More)

Is this relevant?

1986