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.
Boolean satisfiability problemCircuit satisfiability problemSatisfiability modulo theories2-satisfiabilityFunction problemParameterized complexityDpll algorithmCircuit complexityHorn-satisfiabilityTheory of computationConstrained optimizationMaximum subarray problemGeneralized assignment problemModel of computationSearch problemMaximum weight matchingExpspacePartition problemLocal consistencyConjunctive normal formNl-completeTruth tableTseytin transformationLongest palindromic substringComputable setInteger complexityNexptimeLongest increasing subsequenceP-completeConstraint satisfaction problemPcp theoremTrue quantified boolean formulaLagrange multiplierPspace-completeExistential theory of the realsSemidefinite programmingMaximum coverage problemIndex setDecision problemDisjunctive normal formBoolean circuitComputational complexity theoryPspaceComplexity functionMaximum theoremSystem of equationsPseudo-polynomial timeComplexity classMethod of analytic tableauxQuantum complexity theoryBoundary value problemLongest path problemCombinatorial optimizationInteger programmingStrong np-completenessBranch and priceSpace hierarchy theoremTime complexityBoolean algebraOptimization problemSmallest-circle problemCanonical normal formAverage-case complexitySet-builder notationMulti-objective optimizationComputer algebraClique problemFunctional completenessLinear complementarity problemPropositional variableConstraint logic programmingHalting problemBrute-force searchPrinciple of compositionalitySentence clause structureFeasible regionCantor's theoremAxiom of extensionalityConstant-recursive sequenceArithmetical hierarchyAlgebraic combinatoricsNonlinear programmingBranch and cutSatisfiabilityPrimitive recursive functionNon-negative least squaresDiophantine equationMatrix chain multiplicationMaximal and minimal elementsMaximum principleComplex analysisLefschetz fixed-point theoremSubgraph isomorphism problemConstructible universeQuadratic assignment problemFirst-order logicFixed-point theoremsNetwork flow problemBoolean networkCommunication complexity