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.

2012

2012

We define DLOGTIME proof systems, DLTPS, which generalize NC0 proof systems. It is known that functions such as Exact_k and… Expand

Is this relevant?

2007

2007

We present translational lemmas for the three standard models of parallel computation, and apply them to obtain tight hierarchy… Expand

Is this relevant?

2005

2005

We study the complexity of arithmetic in finite fields of characteristic two, $\mathbb{F}_{2^n}$. We concentrate on the following… Expand

Is this relevant?

2004

2004

We present complexity hierarchies on circuits under two DLOGTIME-uniformity conditions. It is shown that there is a language… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Abstract.We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth… Expand

Is this relevant?

2004

2004

We investigate the incremental validation of XML documents with respect to DTDs, specialized DTDs, and XML Schemas, under updates… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

It has been known since the mid-1980s (SIAM J. Comput. 15 (1986) 994; SIAM J. Comput. 21 (1992) 896) that integer division can be… Expand

Is this relevant?

2000

2000

Integer division has been known to lie in P-uniform TC/sup 0/ since the mid-1980s, and recently this was improved to L-uniform TC… Expand

Is this relevant?

1998

1998

We show that all sets that are complete for NP under nonuniformAC0reductions are isomorphic under nonuniformAC0-computable… Expand

Is this relevant?

1995

1995

We investigate properties of the relativized NC and AC hierarchies in their DLOGTIME-, respectively, ALOGTIME-uniform setting and… Expand

Is this relevant?