Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
http://dbpedia.org/resource/Template:Comp-sci-theory-stub
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
24109308
(xsd:integer)
dbo:
wikiPageRevisionID
1069291239
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Asbox
prov:
wasDerivedFrom
wikipedia-en
:Template:Comp-sci-theory-stub?oldid=1069291239&ns=10
is
dbp:
wikiPageUsesTemplate
of
dbr
:Electronic_Notes_in_Theoretical_Computer_Science
dbr
:Electronic_Proceedings_in_Theoretical_Computer_Science
dbr
:NE_(complexity)
dbr
:Set_constraint
dbr
:Parity_measurement
dbr
:Parvaresh–Vardy_code
dbr
:Aperiodic_finite_state_automaton
dbr
:DLOGTIME
dbr
:DPLL(T)
dbr
:Deterministic_automaton
dbr
:ESPACE
dbr
:International_Symposium_on_Algorithms_and_Computation
dbr
:International_Symposium_on_Mathematical_Foundations_of_Computer_Science
dbr
:International_Workshop_on_First-Order_Theorem_Proving
dbr
:L-reduction
dbr
:L/poly
dbr
:Star-free_language
dbr
:Concept_class
dbr
:Generalized_foreground-background
dbr
:Generalized_game
dbr
:Generalized_star-height_problem
dbr
:Low_and_high_hierarchies
dbr
:Quantum_sort
dbr
:Coinduction
dbr
:Continuous_automaton
dbr
:LH_(complexity)
dbr
:LOGCFL
dbr
:Laboratory_for_Foundations_of_Computer_Science
dbr
:Call-by-push-value
dbr
:Compression_theorem
dbr
:Computable_isomorphism
dbr
:Computable_real_function
dbr
:Demonic_non-determinism
dbr
:Empty_type
dbr
:PH_(complexity)
dbr
:Padding_argument
dbr
:Stuttering_equivalence
dbr
:Theoretical_Computer_Science_(journal)
dbr
:Well_equidistributed_long-period_linear
dbr
:GapP
dbr
:Language_equation
dbr
:Log-space_computable_function
dbr
:Log-space_reduction
dbr
:Log-space_transducer
dbr
:Logical_depth
dbr
:3D_Life
dbr
:E_(complexity)
dbr
:Alternating_tree_automata
dbr
:Angelic_non-determinism
dbr
:Balanced_boolean_function
dbr
:Dis-unification_(computer_science)
dbr
:Query_(complexity)
dbr
:R_(complexity)
dbr
:Atlantic_City_algorithm
dbr
:Counting_problem_(complexity)
dbr
:Spectral_test
dbr
:ALL_(complexity)
dbr
:AWPP_(complexity)
dbr
:Effective_complexity
dbr
:Mobile_automaton
dbr
:Recursive_grammar
dbr
:Polylogarithmic_function
dbr
:Carry_operator
dbr
:Ranked_alphabet
dbr
:SC_(complexity)
dbr
:Von_Neumann_neighborhood
dbr
:Nerode_Prize
dbr
:Random-access_Turing_machine
dbr
:Symposium_on_Theoretical_Aspects_of_Computer_Science
dbr
:FL_(complexity)
dbr
:Implicit_computational_complexity
dbr
:Postselection
dbr
:Event-driven_finite-state_machine
dbr
:Exact_quantum_polynomial_time
dbr
:Finite_thickness
dbr
:First-order_reduction
dbr
:PolyL
dbr
:Sample_exclusion_dimension
dbr
:Sophistication_(complexity_theory)
dbr
:Nonelementary_problem
dbr
:Semi-membership
dbr
:Transdichotomous_model
dbr
:Petri_net_unfoldings
dbr
:Supercombinator
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License