MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
NexptimeExpspacePspacePspace-completePseudo-polynomial timeDtimeNl-completeLinear timeComputable setP-completeFunction problemPcp theoremMaximum satisfiability problemTheory of computationComputational hardness assumptionTime complexityExponential distributionPotential methodAverage-case complexityAnalysis of algorithmsAnalysis of parallel algorithmsPolynomial timeTuring jumpNspaceSimon's problemComplexity theoryBlum's speedup theoremPolynomialAppell sequenceProbabilistic turing machineOracle machineModel of computationSpace hierarchy theoremParameterized complexityDeterministic finite automatonSearch problemDiophantine equationComplexity classBinomial typeProbability-generating functionP/polyTarski-seidenberg theoremIndex setKarp reductionHalting problemBinomial distributionDecision tree modelOseledets theoremStrong np-completenessCircuit satisfiability problemEuler's criterionOrdered exponentialQuadratic functionKolmogorov complexityEuler methodLinear differential equationTuring completenessExponentiation by squaring2-satisfiabilityCharacteristic polynomialPolynomial-time reductionCircuit complexityPolynomial hierarchyKirchhoff's theoremLevenshtein automatonPrimitive recursive functionPowerset constructionSturm sequenceBoolean satisfiability problemLanczos algorithmPartition problemTrigonometric polynomialDirichlet's approximation theoremTime hierarchy theoremProbabilistically checkable proofAlgebraic functionTuring reductionExponential generating functionIterative methodRecursively enumerable languageDynamic programmingDecision problemDpll algorithmSemialgebraic setComputability theoryPolynomial codeSieve of sundaramFactorization of polynomialsPfaffianComputable functionQuantum complexity theoryNp-intermediateConstructible universeRecursive languageSystem of polynomial equationsExponential sumPolynomial regressionFundamental theorem of arithmeticInteger complexityHigh