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.
ReductionCash-karp methodReduced algebraP-completeSquare root decompositionPolytimeReductivityKaratsuba algorithmMinimal polynomialPolynomial timeTarski-seidenberg theoremPseudopolynomialReduced ringApproximation algorithmKnuth equivalenceGod's algorithmPrimitive recursionIrreducibleSplitting fieldKnaster-tarski theoremBeta reductionKnuth-bendix completion algorithmGale-shapley algorithmKorf's algorithmRedexLinear timeAbbreviationBellman-ford algorithmMinimum cutLin-kernighan heuristicTouchard polynomialToom-cook algorithmComputability theoryPrimitive polynomialAlgorithm xTschirnhaus transformationChurch-rosser theoremKruskal's algorithmBanach-tarski paradoxAx-kochen theoremConversionGomory's theoremKodaira vanishing theoremSparsifierCanadian traveller problemAutoprojectionKociemba's algorithmRational root theoremRamer-douglas-peucker algorithmDecyclingAutotransformationPerfect fieldPollard's rho algorithmMinimizationSeparable polynomialDe bruijn-erdős theoremKrein-milman theoremSierpinski carpetMatiyasevich's theoremRegular mapKosaraju's algorithmPolynomial algebraInterreducibilityProjectionShor's algorithmRemez algorithmWick's theoremBlum's speedup theoremTravelling salesman problemKernelRook polynomialPicard-lindelöf theoremHerbrand's theoremBuchberger's algorithmRetractionAlgebraic k-theoryPolynomial ringAlgebraic graph theoryFary-milnor theoremQuine-mccluskey algorithmCartesian squareTransformationCoppersmith's methodPolynomial equationProuhet-tarry-escott problemKadane's algorithmAlexander-conway polynomialAlgebraic closureDijkstra's algorithmBongard problemSparsingTraveling salesman problemQuasipolynomialK-algebraOptimization problemTarjan's algorithmTravelling-salesman problemHomomorphismKleene algebraAlexander polynomial