complexity-theory

complexity-theory

Time complexity in n bit array multiplication

Random Polynomial TM

example of reduction a polynomial decision to an NP-complete

L-complement in NP

Algorithm's complexity : Big O notation

Proper oracle for proving P^A=PSPACE^A

Are 2^n and 4^n in the same Big-Θ complexity class?

Is this algorithm O(1)?

Finding the Big-theta notation of a Function

NP-Hardness proof for constrained scheduling with staircase cost

Complexity of iterated logarithm on base 2

Checking if the following language is decideable

Analysis of algorithm about log log n [closed]

Modelling influenza virus with NetLogo

when would an O(n^2) algorithm be preferred over an O(n) algorithm?

Complexity order

Understanding Polynomial TIme Approximation Scheme

complexity of a Sequential algorithm - min suffixes

Nondeterminism versus polynomial-time verifiability

Are there any problems which requires more than double exponential time?

Decision problems that can't even be decided efficiently?

same on space but different in time complexity [closed]

complexity analysis for double loops

Complexity of Pascals formula

Big Oh and Omega notation complexity proof

Big O notation complexity

Complexity of Operation That Isn't Performed

Is it possible to find the largest drop between two numbers in an array in less than O(n²) complexity?

Why is this time complexity O(n)?

How can some NP-Complete problems be also NP-Hard?

Complexity measurement of NP-complete

Pseudo-polynomial algorithms - math

Prefix sum time complexity

Complexity of a triple for loop

What is the asymptotic complexity of log_2(n)-log_3(n)?

Big Theta Proof

Big O Notation, when can we drop constants legally?

Which algorithm is better?

Big O complexity notation

If algorithm time complexity is theta(n^2), is it possible that for one input it will run in O(n)?

what's the time complexity of the following program [closed]

Why is the complement of SAT not in NP?

Why is O(n) equal to O(2n)

Tight Runtime Bound for loop

Time complexity involving product of variables

Are there any decision problems in NP-Hard whose solution is not verifiable in polynomial time?

what is big-O in hamming distance?

Decision Problems Reduction in Polynomial Time

Calculation time for addition of two 8 digits numbers to 4 million digits

complexity for recursion function

What's a non-deterministic procedure?

Complexity's and Run times

Resolution of a nanoTime() Timer

Traveling Salesman with Special Metric

Big O - for loop increment by partial N

complexity -big O notation , theta and omega

Big Omega notation - what is f = Ω(g)?

What's is the time complexity in this code?

time complexity for code and an order of magnitude improvement

Recurrence complexity [closed]

page:3 of 5 prev page next page main page

Categories

jenkins-pipeline

apache-kafka-streams

puppeteer-sharp

azure-cyclecloud

helix-3d-toolkit

google-api-js-client

angularjs-ng-repeat

firebase-test-lab

eslint-config-vue

phppresentation

tekton-pipelines

nsoperationqueue

uigesturerecognizer

mongoose-populate

react-native-navigatio...

nsarraycontroller

android-kenburnsview

gwt-maven-plugin

asp.net-dynamic-data

sql-server-ce-4

virtualpathprovider

program-transformation

google-notebook

Resources