complexity-theory

complexity-theory

Does Reducing P or NP instance to NP-Complete make that instance also NP-Hard?

Analyse time complexity in terms of Big theta

Big O complexity of for nested loop

How citation networks are associated with complex adaptive systems?

Nash Equilibria and Load Balancing Game

NP-complete vs NP-hard (why are they unequal?)

How to work out the complexity of an algorithm?

Linear Program to solve NP-hard problems

Calculate the big-O and big-Omega of the following piece of code

Finding a door in an infinitly long wall

Example of an undecidable that is not NP-hard?

fastest implementation to cut n×n board into n connected n-minos

Solving 2sat #P algorithm results into P=NP

What is O(1) space complexity?

Karp reduction from PARTITION to SUBSET SUM

How do I prove a class-room scheduling issue to be NP complete correctly?

Provide a context-free grammar that generates odd length language {w = 0*1* : |w| is odd} [closed]

Is polynomial reduction reversible?

How do I reduce Hamiltonian path to a weight-constrained Hamiltonian path?

Why is co-P = P

complexity of calling a function n times

Time Complexity nested loops

Time complexity of Code

Chomsky Normal Form Conversion Algorithm

Why co-NP is not a subset of NP

Why is chess, checkers, Go, etc. in EXP but conjectured to be in NP?

How reduction is used to prove hardness through contradiction?

L in P/Poly but L not in P

What is an approach for designing complex FSMs?

What does this sentence mean "It is NP-hard to approximate the Max-3-DM with bound 2 "?

Cost of a round-based distributed algorithm

Order of complexity of fibonacci functions

Is the complement of the language CLIQUE element of NP?

Bubble sort complexity O(n)

Is the complement of any context free language context free?

Big-O complexity of calculation: Drawing a non-colliding subset of k elements from n total with dumb algorithm

Complexity of multiplication reducing modulo N after each step

Proving that a language's length is divided by 2 is undecidable

Why is the term 'reduce' used in the context of NP complexity?

Computational Complexity of SIFT descriptor?

Trying to proof NP-completeness

In a reduction with additive but nonlinear blow up can I still get APX-Hardness?

TSP vs. Word Unscrambler

Calculating complexities of both time and space

3SAT solved in polynomial time?

How is the given linear CFL NL-complete

A set of languages over {0, 1} which does not belong to Recursively Enumerable set are uncountable [closed]

Multiple Knapsack, weight = profit

Prove that any algorithm for solving disjoint sets takes at least nlog n

Definition of space complexity

Prove: if P=NP then there is polynomial reduction Clique to Path

Determination of computational complexity of sample code

Big O vs Small omega

Calculating time complexity of functions when both contain each other?

Can an operation that takes O(1) amortized time have worst-case O(n^2) time?

If P != NP, are there more P than non-P problems or vice versa? [closed]

If P = NP, why does P = NP = NP-Complete? [closed]

Does every NP-complete prob. admit a polynomial-time restriction?

Is a lookup in a hash table O(1)?

FIbonacci Time Complexity for non recursive function

page:2 of 5 prev page next page main page

Categories

computation-theory

temenos-quantum

jquery-scrollify

task-parallel-library

react-three-fiber

crystal-reports-2008

expo-notifications

asciidoctor-pdf

load-data-infile

google-cloud-talent-so...

aws-direct-connect

apache-commons-lang

ckeditor5-react

google-auth-library

crystal-reports-2013

foreign-key-relationship

password-generator

iced-coffeescript

xcode-organizer

navigationservice

underscore.js-templating

installshield-2009

contextswitchdeadlock

html-components

content-delivery-network

Resources