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.
PspaceExptimePspace-completeNexptimeNl-completeNspaceSpace hierarchy theoremP-completeFunction problemDtimePseudo-polynomial timeTheory of computationComplexity theoryComputable setModel of computationMaximum satisfiability problemSearch problemConstructible universeIndex setComplexity classComputable functionOracle machineComputability theoryTuring jumpSpace complexitySystem of polynomial equationsAnalysis of algorithmsProbabilistic turing machineTime complexityCombinatorial optimizationDiophantine equationPolynomialLinear differential equationParameter spaceDecision problemCircuit complexityMatiyasevich's theoremP/polyTuring reductionLinear timeTarski-seidenberg theoremDirichlet's approximation theoremPotential methodAnalysis of parallel algorithmsTuring computable functionParameterized complexityPolynomial timeAverage-case complexityProbability-generating functionComputational hardness assumptionAlgebraic elementPolylogarithmic functionTuring degreeComputational resourceKarp reductionPcp theoremBlum's speedup theoremLefschetz fixed-point theoremSavitch's theoremStrong np-completenessSequential compactnessOrdered exponentialSatisfiability modulo theoriesComputational complexityAlgebraic functionTuring completenessProbability measureInteger complexityFeasible regionReal coordinate spaceClassical wiener spaceCantor's theoremTheory of equationsComputational complexity theoryExponential mapGrassmannianSample spaceSeparable polynomialPolynomial-time reductionPolynomial interpolationDirichlet problemBinomial typeCantor spaceDegree of a polynomialSystem of equationsIsometry groupBoolean circuitLinear algebraic groupSequence spaceIndex calculus algorithmPfaffianAffine groupSet functionSturm's theoremBuchberger's algorithmCircuit satisfiability problemComplex measureRecursive languageInteger latticeNumerical analysis