Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2013

2013

We study the quantum complexity class $${\mathsf{QNC}^\mathsf{0}_\mathsf{f}}$$QNCf0 of quantum operations implementable exactly… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

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

Is this relevant?

2010

2010

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

Is this relevant?

2008

2008

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

Is this relevant?

Highly Cited

2007

Highly Cited

2007

A process and system for sequentially cracking hydrocarbon. A first hydrocarbon feed is cracked at high severity low residence… Expand

Is this relevant?

2000

2000

Powerful solutions enabling interoperability must allow applications to evolve and the requirements of shared databases to change… Expand

Is this relevant?

1998

1998

The growing context-sensitive languages (GCSL) are characterized by a nondeterministic machine model, the so-called shrinking two… Expand

Is this relevant?

1998

1998

We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: - Most strings in easy… Expand

Is this relevant?

1997

1997

Declaration I the undersigned hereby declare that the work contained in this dissertation is my own original work and has not… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

A new model, non-uniform deterministic finite automata (NUDFA's) over general finite monoids, has recently been developed as a… Expand

Is this relevant?