193 search results - page 2 / 39 » Exponential lower bounds for the numbers of Skolem-type sequ... |
SIAMCOMP
2002
13 years 4 months ago
2002
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
ECCC
2010
13 years 1 days ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
APAL
2007
13 years 5 months ago
2007
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL...
DCG
2006
13 years 5 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
COMPGEOM
2009
ACM
13 years 10 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....