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.
NexptimeTime complexityTime hierarchy theoremNspaceComputational resourceComputational complexityExpspaceAnalysis of algorithmsAverage-case complexityComplexity theoryComputable functionExptimePspaceComplexity classTuring computable functionComputational complexity theoryProbabilistic turing machineTime domainLinear timePolynomial timeAnalysis of parallel algorithmsOracle machineNondeterministic turing machineReal computationAmortized analysisComputability theorySavitch's theoremEntropy rateTime constantIndex calculus algorithmLyapunov timeModel of computationNl-completeTime derivativeBoolean circuitDynamic simulationAlgorithmic efficiencyQuantum complexity theoryTopological entropyDiscrete-time fourier transformTheory of computationFinite-state machinePotential methodStrong np-completenessSearch problemTrue quantified boolean formulaDynamic time warpingMarkov decision processTransfer functionTime evolutionRegister machineMoore machineDiscrete-event simulationCircuit complexityHalting problemTuring machineChurch-turing thesisPseudo-polynomial timeComputational problemApproximation algorithmSpanHamiltonianReplicator equationComputational learning theoryTime dependent vector fieldType theoryPolynomial-time reductionMatiyasevich's theoremDeterministic finite automatonTitchmarsh convolution theoremFunction problemLinear bounded automatonTime-evolving block decimationSemiautomatonWall timeRice's theoremDynamical systemQuantum finite automatonExponential time hypothesisKleene's algorithmDynamical systems theoryRichardson's theoremMealy machineKolmogorov complexityParameterized complexityPrime number theoremComputable setLimit setOseledets theoremTransversality conditionConstructible universeQuantum speed limitDiscrete time and continuous timeComputational intelligenceDigital signalMarkov chainTime averageStandard modelCombinatorial game theoryLongest path problem