| dbo:abstract |
Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes. (en) Configuração de grafos é uma ferramenta teórica usada na teoria da complexidade computacional para provar a relação entre o problema de alcance dos grafos e a complexidade de classes. (pt) |
| dbo:wikiPageID |
27608919 (xsd:integer) |
| dbo:wikiPageLength |
4232 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1014538428 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Cambridge_University_Press dbr:Deterministic_finite_automaton dbc:Application-specific_graphs dbr:Graph_(discrete_mathematics) dbr:NL_(complexity) dbr:L_(complexity) dbr:Complete_(complexity) dbr:Computational_complexity_theory dbr:Reachability dbc:Computational_complexity_theory dbr:Turing_machine dbr:Finite_automata dbr:Labeled_graph dbr:NL_(complexity_class) |
| dbp:wikiPageUsesTemplate |
dbt:Cite_book dbt:Fact dbt:Reflist dbt:More_refs |
| dct:subject |
dbc:Application-specific_graphs dbc:Computational_complexity_theory |
| gold:hypernym |
dbr:Tool |
| rdf:type |
dbo:Software |
| rdfs:comment |
Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes. (en) Configuração de grafos é uma ferramenta teórica usada na teoria da complexidade computacional para provar a relação entre o problema de alcance dos grafos e a complexidade de classes. (pt) |
| rdfs:label |
Configuration graph (en) Configuração de grafos (pt) |
| owl:sameAs |
freebase:Configuration graph wikidata:Configuration graph dbpedia-pt:Configuration graph https://global.dbpedia.org/id/4i1Q5 |
| prov:wasDerivedFrom |
wikipedia-en:Configuration_graph?oldid=1014538428&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Configuration_graph |
| is dbo:wikiPageWikiLink of |
dbr:State_space_search dbr:Symmetric_Turing_machine |
| is foaf:primaryTopic of |
wikipedia-en:Configuration_graph |