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.
ExpspacePspace-completeNspaceExptimeNl-completeNexptimeP/polyP-completeComplexity classSpace complexitySpace hierarchy theoremTime complexityPseudo-polynomial timeDtimeSearch problemComputational resourceFunction problemPolynomial-time reductionStrong np-completenessTheory of computationComputational hardness assumptionMaximum satisfiability problemComputational complexity theoryPolynomial hierarchyDecision problemComputational problemCircuit complexityCombinatorial optimizationModel of computationAverage-case complexityParameter spaceConstructible universeFinite topological spaceSatisfiability modulo theoriesProbabilistic turing machineKarp's 21 np-complete problemsInteger programmingOptimization problemLongest path problemParameterized complexityPcp theoremArithmetic circuit complexityQuantum complexity theoryDiophantine equationPareto frontSieve of pritchardProperty testingReal computationSperner's theoremPolytope modelQuadratic programmingComputable setInteger complexityTheory of equationsBoolean circuitSystem of equationsSemidefinite programmingHalting problemSystem of polynomial equationsComputable numberPolynomialConvex hull of a simple polygonPotential methodCapacity of a setAlgorithmDegree of a polynomialIndex setProbabilistically checkable proofCantor's theoremLinear differential equationComparison of topologiesExistential theory of the realsComplete measureTime hierarchy theoremFinite setSample spaceSimon's problemSequence spacePattern languagePrime number theoremCompactness theoremTuring reductionCantor spaceNondeterministic turing machineField of definitionStone spaceCompact-open topologyPolynomial matrixGeneral number field sieveAmortized analysisCombinatorial game theoryP-adic analysisSmallest-circle problemNp-intermediatePrimitive recursive functionTuring degreeGeneralized assignment problemMatrix chain multiplicationPower setMetric k-center