Featured
Compare webshops (2)
Pages: 76, Paperback, Alphascript Publishing
OmniScriptum
Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm
Parameterized Complexity: Computational Complexity Theory, Vertex Cover Problem, Parameter Space
Maximum satisfiability Problem: Computational complexity theory, Propositional formula, NP hard, Boolean problem, complete, APX
Betascript Publishers
Optimal Decision: Decision Theory, Mathematical Optimization, Conditional Probability Distribution, Monty Hall Problem
Back to top