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.
Computational hardness assumptionBlum's speedup theoremSchinzel's hypothesis hTime hierarchy theoremEuler's sum of powers conjectureJacobian conjectureSavitch's theoremStrong np-completenessReal computationCollatz conjectureRice's theoremContinuum hypothesisComputability theoryPolynomial timeTime complexityComplexity classDtimeStructured program theoremTheory of everythingOseledets theoremCosmological perturbation theoryIndex calculus algorithmGödel's incompleteness theoremHypercomputationPenrose interpretationChurch-turing thesisMatiyasevich's theoremRichardson's theoremProbabilistic methodNachbin's theoremProbabilistically checkable proofTraveling purchaser problemQuantum complexity theoryGeneralized riemann hypothesisParis-harrington theoremBell's theoremSimon's problemGoldbach's conjectureAlgorithmic probabilityComputational problemTitchmarsh convolution theoremConjectureLinear timeNexptimeHaag's theoremSearch problemHolevo's theoremThesisPrime number theoremPopoviciu's inequalityApproximation algorithmMathematical universe hypothesisConnes embedding problemConformal cyclic cosmologyNovikov self-consistency principleComplexity theoryAxiom of extensionalityAxiom of infinityHoeffding's inequalityFermat's last theoremSchanuel's conjectureFermat primality testHorner's methodS-matrix theoryLegendre's constantHodge conjectureTarski's undefinability theoremPseudo-polynomial timeExponential mapMathematical proofErgodic hypothesisEuler's criterionEternal inflationHungarian algorithmComputational complexityComputational resourceDigital physicsWorking hypothesisHamiltonian simulationClosed-subgroup theoremNo free lunch theoremCox's theoremComputational complexity theoryChaitin's constantSimulated annealingGoldbach's weak conjectureGrothendieck inequalityLongest path problemProof of impossibilityHalting problemNatural proofSperner's theoremQuantum field theoryPicard-lindelöf theoremCover's theoremFunction problemSatisfiability modulo theoriesParameterized complexityCalculus of constructionsRead's conjecture