Matches in DBpedia 2015-10 for { ?s ?p "In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function. It is also equivalently defined as the class PSIZE of languages that have a polynomial-size circuits."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.