In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, thatâ€¦Â (More)

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

2014

2014

- YU ChaoHua, GUO GongDe, Lin Song
- 2014

An arbitrated quantum signature scheme without using entangled states is proposed. In the scheme, by employing a classical hashâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Damien StehlÃ©, Ron Steinfeld
- ASIACRYPT
- 2010

We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a moreâ€¦Â (More)

Is this relevant?

2007

2007

We consider exact real solving of well-constrained, bivariate systems of relatively prime polynomials. The main problem is toâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Erich Kaltofen, Gilles Villard
- computational complexity
- 2004

We present new baby steps/giant steps algorithms of asymptotically fast running time for dense matrix problems. Our algorithmsâ€¦Â (More)

Is this relevant?

2002

2002

- Kian Hsiang Low, Wee Kheng Leow, Marcelo H. Ang
- AAMAS
- 2002

Research in the planning and control of mobile robots has received much attention in the past two decades. Two basic approachesâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Martin Hirt, Kazue Sako
- EUROCRYPT
- 2000

Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying andâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Joung-Youn Kim, Lee-Sup Kim, Seung-Ho Hwang
- ISCAS
- 2000

In this paper, an advanced histogram-equalization algorithm for contrast enhancement is presented. Histogram equalization is theâ€¦Â (More)

Is this relevant?

1995

1995

- Joonsoo Choi, JÃ¼rgen Sellen, Chee-Keng Yap
- Symposium on Computational Geometry
- 1995

Precision-Sensitive Euclidean Shortest Path in 3-Space *Â

Is this relevant?

1993

1993

- John F. Canny
- Comput. J.
- 1993

Recently there has been a lot of activity in algorithms that work over real closed elds, and that perform such calculations asâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Yishay Mansour
- ICALP
- 1992

We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. Theâ€¦Â (More)

Is this relevant?