Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/ACC0> ?p ?o }
Showing triples 1 to 62 of
62
with 100 triples per page.
- ACC0 abstract "ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The class is defined by augmenting the class AC0 of constant-depth "alternating circuits" with the ability to count; the acronym ACC stands for "AC with counters". Specifically, a problem belongs to ACC0 if it can be solved by polynomial-size, constant-depth circuits of unbounded fan-in gates, including gates that count modulo a fixed integer. ACC0 corresponds to computation in any solvable monoid. The class is very well studied in theoretical computer science because of the algebraic connections and because it is one of the largest concrete computational models for which computational impossibility results, so-called circuit lower bounds, can be proved.".
- ACC0 thumbnail Diagram_of_an_ACC0_Circuit.svg?width=300.
- ACC0 wikiPageExternalLink fsttcs.pdf.
- ACC0 wikiPageExternalLink acc-lbs.pdf.
- ACC0 wikiPageID "7729684".
- ACC0 wikiPageLength "8491".
- ACC0 wikiPageOutDegree "30".
- ACC0 wikiPageRevisionID "653767020".
- ACC0 wikiPageWikiLink AC0.
- ACC0 wikiPageWikiLink AND_gate.
- ACC0 wikiPageWikiLink Big_O_notation.
- ACC0 wikiPageWikiLink Category:Circuit_complexity.
- ACC0 wikiPageWikiLink Category:Complexity_classes.
- ACC0 wikiPageWikiLink Circuit_complexity.
- ACC0 wikiPageWikiLink Computing_the_permanent.
- ACC0 wikiPageWikiLink Derandomization.
- ACC0 wikiPageWikiLink Fan-in.
- ACC0 wikiPageWikiLink IP_(complexity).
- ACC0 wikiPageWikiLink Inverter_(logic_gate).
- ACC0 wikiPageWikiLink Journal_of_Computer_and_System_Sciences.
- ACC0 wikiPageWikiLink Journal_of_the_ACM.
- ACC0 wikiPageWikiLink Logtime.
- ACC0 wikiPageWikiLink Majority_function.
- ACC0 wikiPageWikiLink Monoid.
- ACC0 wikiPageWikiLink NEXPTIME.
- ACC0 wikiPageWikiLink NOT_gate.
- ACC0 wikiPageWikiLink OR_gate.
- ACC0 wikiPageWikiLink PP_(complexity).
- ACC0 wikiPageWikiLink Randomized_algorithm.
- ACC0 wikiPageWikiLink SIAM_Journal_on_Computing.
- ACC0 wikiPageWikiLink Solvable_group.
- ACC0 wikiPageWikiLink Springer-Verlag.
- ACC0 wikiPageWikiLink Springer_Science+Business_Media.
- ACC0 wikiPageWikiLink Symposium_on_Theory_of_Computing.
- ACC0 wikiPageWikiLink TC0.
- ACC0 wikiPageWikiLink Theoretical_Computer_Science_(journal).
- ACC0 wikiPageWikiLink Time_hierarchy_theorem.
- ACC0 wikiPageWikiLink Todas_theorem.
- ACC0 wikiPageWikiLink File:Diagram_of_an_ACC0_Circuit.svg.
- ACC0 wikiPageWikiLinkText "ACC0".
- ACC0 hasPhotoCollection ACC0.
- ACC0 wikiPageUsesTemplate Template:Citation.
- ACC0 wikiPageUsesTemplate Template:ComplexityClasses.
- ACC0 wikiPageUsesTemplate Template:Harvtxt.
- ACC0 wikiPageUsesTemplate Template:Refbegin.
- ACC0 wikiPageUsesTemplate Template:Refend.
- ACC0 wikiPageUsesTemplate Template:Reflist.
- ACC0 subject Category:Circuit_complexity.
- ACC0 subject Category:Complexity_classes.
- ACC0 hypernym Models.
- ACC0 type Person.
- ACC0 type Class.
- ACC0 comment "ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The class is defined by augmenting the class AC0 of constant-depth "alternating circuits" with the ability to count; the acronym ACC stands for "AC with counters". Specifically, a problem belongs to ACC0 if it can be solved by polynomial-size, constant-depth circuits of unbounded fan-in gates, including gates that count modulo a fixed integer.".
- ACC0 label "ACC0".
- ACC0 sameAs ACC0.
- ACC0 sameAs ACC0.
- ACC0 sameAs m.026b5cb.
- ACC0 sameAs Q4650523.
- ACC0 sameAs Q4650523.
- ACC0 wasDerivedFrom ACC0?oldid=653767020.
- ACC0 depiction Diagram_of_an_ACC0_Circuit.svg.
- ACC0 isPrimaryTopicOf ACC0.