In computational complexity theory, the Sipser–Lautemann theorem or Sipser–Gács–Lautemann theorem states that bounded-error probabilistic polynomial… (More)

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

2017

2017

- Henrik Björklund
- 2017

Hyperedge replacement grammars (HRGs, see [7, 6]) are one of the most successful formal models for the generative specification… (More)

Is this relevant?

2013

2013

- Martin Avanzini, Georg Moser
- RTA
- 2013

The Tyrolean Complexity Tool, TCT for short, is an open source complexity analyser for term rewrite systems. Our tool TCT… (More)

Is this relevant?

2013

2013

Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has potential applications in… (More)

Is this relevant?

2011

2011

- Martin Avanzini, Naohi Eguchi, Georg Moser
- RTA
- 2011

In this paper we present a new path order for rewrite systems, the exponential path order EPO. Suppose a term rewrite system is… (More)

Is this relevant?

2010

2010

- Guillaume Bonfante, Florian Deloup
- TAMC
- 2010

In the field of implicit computational complexity, we are considering in this paper the fruitful branch of interpretation methods… (More)

Is this relevant?

2008

2008

- Christian Mathissen
- ICALP
- 2008

Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper… (More)

Is this relevant?

2008

2008

Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program… (More)

Is this relevant?

2006

2006

- Jan Arpe
- 2006

In this thesis, we are concerned with two major challenges in computational learning theory: learning in the presence of large… (More)

Is this relevant?

2005

2005

- Johann A. Makowsky
- CSL
- 2005

The treasurer and board member of the European Association for Computer Science Logic (EACSL), Prof. Dr. Clemens Lautemann passed… (More)

Is this relevant?

1997

1997

- Samuel R. Buss
- 1997

1 Preface and Acknowledgements This article is an abridged and revised version of a 1996 McGill University technical report [14… (More)

Is this relevant?