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.
Complexity classComputational problemSearch algorithmComputability theoryDecision problemComputational resourceStrong np-completenessModel of computationReductionFunction problemComputational complexity theoryBoolean circuitSatisfiability modulo theoriesOptimization problemPolynomial-time reductionLattice problemCombinatorial optimizationTheory of computationComplexity theoryCircuit complexityP/polyMetric k-centerAnalysis of algorithmsRelationConstraint satisfactionConstraint programmingTime complexityMathematical problemComputable functionParameterized complexityLongest path problemCombinatoricsInteger programmingCycle detectionBoolean expressionMaximum coverage problemSet cover problemComputational complexityAlgorithmSearch data structureLocal consistencyRoot-finding algorithmsNatural proofComplementP-completeConstraint satisfaction problemOptimal substructurePermutation patternType theoryTernary searchRange searchingGraph theoryRelational operatorTime hierarchy theoremAnalysis of parallel algorithmsJob-shop schedulingQuadratic programmingGeneralized assignment problemIndex calculus algorithmQuantum complexity theoryMaximum satisfiability problemConstraintGraph isomorphism problemBinary search algorithmConstraint logic programmingEvolutionary algorithmComputational learning theoryReal computationExpspaceIndex setNexptimeKarp's 21 np-complete problemsData typePspaceLinear complementarity problemCombinatorial game theorySavitch's theoremSubgraph isomorphism problemCoinductionPreorderComputational topologyPattern languageBoundary value problemNonlinear programmingNumerical methodAssignment problemComputational geometryProcess calculusTabu searchMatrix chain multiplicationEquivalence relationComplex analysisLongest common subsequence problemGraphNumerical analysisConvex optimizationSkip listSystem of equationsBinary functionAlgorithmic information theory