Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in np-complete

Constrained Knapsack without weight

algorithm combinatorics knapsack-problem approximation np-complete

Why all NP-complete problems can be reducible to 3-SAT? [closed]

np np-complete sat

Is it compulsory that the 'reduction of p‌r‌o‌b‌l‌e‌m be done in polynomial time' for it to be NP complete?

algorithm np-complete np

Difference between C-SAT and SAT?

algorithm np-complete sat satisfiability

set of vertex-disjoint cycles so that each vertex belongs to a cycle

vertex np-complete disjoint-sets

Reducing TSP to Hamiltonian circuit

algorithm graph graph-algorithm np-complete reduction

What is the simplest, easiest algorithm for finding EMST of a complete graph of order 10^5

algorithm minimum-spanning-tree np-complete polynomial-approximations

Can NP-Intermediate exist if P = NP?

complexity-theory np-complete

Comparing syntax trees modulo alpha conversion

haskell syntax abstract-syntax-tree np-complete lambda-calculus

can some sorting be P, NP, and NP-Complete?

algorithm sorting np-complete np p-np

Counting Subgraph Instances

algorithm graph graph-theory np-complete isomorphism

Reduce Subset Sum to Polyomino Packing

algorithm np-complete subset-sum

Is this combinatorial optimization problem NP-hard?

algorithm optimization combinatorics mathematical-optimization np-complete

If a problem X (decision problem) is known to be NP-Complete, and proven to be reduced to problem Y, can you then say problem Y is NP-Complete?

computer-science theory np-complete

NP-Completeness in Task Scheduling

algorithm job-scheduling np-complete np operations-research

Efficient scheduling jobs with declining profits on multiple machines

algorithm job-scheduling maximize np-complete approximate

Algorithm for scheduling jobs on processors

algorithm job-scheduling np-complete

Subset Inference NP-complete?

algorithm np-complete

minimal multiplications vs a set-cover issue

algorithm set np-complete linear-programming set-cover

Verification algorithm for minimum vertex cover?

algorithm graph vertex np-complete
Older Entries »