Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Alternating_Turing_machine> ?p ?o }
Showing triples 1 to 69 of
69
with 100 triples per page.
- Alternating_Turing_machine abstract "In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer and independently by Kozen in 1976, with a joint journal publication in 1981.".
- Alternating_Turing_machine wikiPageID "753230".
- Alternating_Turing_machine wikiPageLength "11405".
- Alternating_Turing_machine wikiPageOutDegree "29".
- Alternating_Turing_machine wikiPageRevisionID "674621040".
- Alternating_Turing_machine wikiPageWikiLink Ashok_K._Chandra.
- Alternating_Turing_machine wikiPageWikiLink Boolean_function.
- Alternating_Turing_machine wikiPageWikiLink Boolean_satisfiability_problem.
- Alternating_Turing_machine wikiPageWikiLink Category:Models_of_computation.
- Alternating_Turing_machine wikiPageWikiLink Christos_Papadimitriou.
- Alternating_Turing_machine wikiPageWikiLink Circuit_minimization_for_Boolean_functions.
- Alternating_Turing_machine wikiPageWikiLink Circuit_minimization_problem.
- Alternating_Turing_machine wikiPageWikiLink Co-NP.
- Alternating_Turing_machine wikiPageWikiLink Complexity_class.
- Alternating_Turing_machine wikiPageWikiLink Complexity_classes.
- Alternating_Turing_machine wikiPageWikiLink Computational_complexity_theory.
- Alternating_Turing_machine wikiPageWikiLink Constructible_function.
- Alternating_Turing_machine wikiPageWikiLink Dexter_Kozen.
- Alternating_Turing_machine wikiPageWikiLink EXPSPACE.
- Alternating_Turing_machine wikiPageWikiLink EXPTIME.
- Alternating_Turing_machine wikiPageWikiLink Formal_language.
- Alternating_Turing_machine wikiPageWikiLink Immerman–Szelepcsényi_theorem.
- Alternating_Turing_machine wikiPageWikiLink LH_(complexity).
- Alternating_Turing_machine wikiPageWikiLink Larry_Stockmeyer.
- Alternating_Turing_machine wikiPageWikiLink Michael_Sipser.
- Alternating_Turing_machine wikiPageWikiLink NP_(complexity).
- Alternating_Turing_machine wikiPageWikiLink Non-deterministic_Turing_machine.
- Alternating_Turing_machine wikiPageWikiLink PSPACE.
- Alternating_Turing_machine wikiPageWikiLink P_(complexity).
- Alternating_Turing_machine wikiPageWikiLink Parallel_computation_thesis.
- Alternating_Turing_machine wikiPageWikiLink Polynomial_hierarchy.
- Alternating_Turing_machine wikiPageWikiLink Quantified_Boolean_formula_problem.
- Alternating_Turing_machine wikiPageWikiLink Space_constructible.
- Alternating_Turing_machine wikiPageWikiLink True_quantified_Boolean_formula.
- Alternating_Turing_machine wikiPageWikiLink Tuple.
- Alternating_Turing_machine wikiPageWikiLinkText "Alternating Turing machine".
- Alternating_Turing_machine wikiPageWikiLinkText "alternating Turing machine".
- Alternating_Turing_machine wikiPageWikiLinkText "bounded alternating Turing machine".
- Alternating_Turing_machine hasPhotoCollection Alternating_Turing_machine.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Citation_needed.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Cite_book.
- Alternating_Turing_machine wikiPageUsesTemplate Template:More_footnotes.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Null.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Reflist.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Turing.
- Alternating_Turing_machine wikiPageUsesTemplate Template:Unreferenced_section.
- Alternating_Turing_machine subject Category:Models_of_computation.
- Alternating_Turing_machine hypernym Machine.
- Alternating_Turing_machine type Article.
- Alternating_Turing_machine type Model.
- Alternating_Turing_machine type Software.
- Alternating_Turing_machine type Article.
- Alternating_Turing_machine type Method.
- Alternating_Turing_machine type Model.
- Alternating_Turing_machine comment "In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer and independently by Kozen in 1976, with a joint journal publication in 1981.".
- Alternating_Turing_machine label "Alternating Turing machine".
- Alternating_Turing_machine sameAs Alternierende_Turingmaschine.
- Alternating_Turing_machine sameAs Máquina_de_Turing_alternante.
- Alternating_Turing_machine sameAs ماشین_تورینگ_متناوب.
- Alternating_Turing_machine sameAs Alternirajući_Turingov_stroj.
- Alternating_Turing_machine sameAs 交替性チューリング機械.
- Alternating_Turing_machine sameAs 교대_튜링_기계.
- Alternating_Turing_machine sameAs Máquina_de_Turing_alternada.
- Alternating_Turing_machine sameAs m.038ft3.
- Alternating_Turing_machine sameAs Q438833.
- Alternating_Turing_machine sameAs Q438833.
- Alternating_Turing_machine sameAs 交替式图灵机.
- Alternating_Turing_machine wasDerivedFrom Alternating_Turing_machine?oldid=674621040.
- Alternating_Turing_machine isPrimaryTopicOf Alternating_Turing_machine.