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

New posts in theory

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

Algorithm - generating all combinations from items that must be chosen in sequence

algorithm theory combinatorics

Decidability and Recursive Enumerability

computer-science theory turing-machines computability

Why does the default value of a boolean variable tend to be false? [closed]

programming-languages theory

Distance metric for algorithms

algorithm distance theory

Namespace and module confusion in typescript?

module typescript namespaces theory

How does merging a branch actually work (under the hood)?

merge versioning theory

PHP/mysql - Queries vs arrays?

php mysql theory

Is it a state machine when it works with memory?

theory state-machine

Function "normalization"

function language-agnostic theory function-declaration

Retrieve multiple information by a single number?

algorithm math numbers theory chmod

Is there a difference between a list and a tuple?

list tuples theory

Minimal path to form a string

algorithm dynamic-programming theory

The "Waiting lists problem"

algorithm language-agnostic theory

Finding the heaviest length-constrained path in a weighted Binary Tree

algorithm theory binary-tree

Shift-reduce: when to stop reducing?

parsing theory context-free-grammar formal-languages shift-reduce

What makes an NP-hard problem not to be an NP-complete problem?

computer-science theory complexity-theory np

Inductive Specification: Top-down vs Bottom-up vs Rules of Inference?

math recursion logic theory induction

Why is (a | b ) equivalent to a - (a & b) + b?

oracle binary computer-science theory proofs

What is the relationship between event loop and Promise [duplicate]

javascript promise theory event-loop
« Newer Entries Older Entries »