Tag:Csci3434
From Wikipedia, the free encyclopedia
Jump to: navigation, search
Related Tags
math mathematics complexity collatz conjecture algorithms np logic science theory algorithm np-complete cs interesting computerscience maths open unsolved computer cantor compsci karp npcomplete study computing programming problem datastructure np-hard winter2008 #tag-refactored proof method diagonal_method cantor%27s_diagonal_argument lookat logika-ispit math.settheory idea.key cardinal_number computability proofs concepts set_theory real.analysis idea number np-npc-p 3n+1 temps computability_problems collatz_conjecture 2n+1 maths-resources todescribe projects millenium syracuse to_read conjectures coq_art complexitytheory time computational complete algorithm.complexity informatics turingproject from:jaanix problem+solving research space computers
Articles
- Collatz conjecture (1)
- NP (complexity) (1)complexity np algorithms wikipedia mathematics algorithm theory science study programming computerscience computer problem+solving np-npc-p math research space turingproject informatics time wiki complexitytheory computational complete algorithm.complexity computers computing csci3434 concepts datastructure
- Karp's 21 NP-complete problems (1)
- Cantor's diagonal argument (1)
Retrieved from "http://en.wikipedia.org/wiki/Tag:Csci3434"
