Context of computational complexity

Known as: Bit complexity, Complexity of computation 
In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2018
010203019742018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
An arbitrated quantum signature scheme without using entangled states is proposed. In the scheme, by employing a classical hash… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more… (More)
  • figure 4
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)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present new baby steps/giant steps algorithms of asymptotically fast running time for dense matrix problems. Our algorithms… (More)
  • table 6.1
Is this relevant?
2002
2002
Research in the planning and control of mobile robots has received much attention in the past two decades. Two basic approaches… (More)
  • figure 1
  • figure 8
Is this relevant?
Highly Cited
2000
Highly Cited
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
In this paper, an advanced histogram-equalization algorithm for contrast enhancement is presented. Histogram equalization is the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
Precision-Sensitive Euclidean Shortest Path in 3-Space * 
  • table 2
Is this relevant?
1993
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
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The… (More)
Is this relevant?