Matches in DBpedia 2016-04 for { <http://doi.org/10.1007/bf01744431> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- bf01744431 date "1984-12-01".
- bf01744431 doi "10.1007/BF01744431".
- bf01744431 doi "10.1007/bf01744431".
- bf01744431 first "Merrick".
- bf01744431 first1 "M.".
- bf01744431 first1 "Merrick L.".
- bf01744431 first1 "Merrick".
- bf01744431 first2 "J. B.".
- bf01744431 first2 "James B.".
- bf01744431 first3 "M.".
- bf01744431 first3 "Michael".
- bf01744431 isCitedBy AC0.
- bf01744431 isCitedBy Circuit_complexity.
- bf01744431 isCitedBy Michael_Sipser.
- bf01744431 isCitedBy Regular_language.
- bf01744431 issn "0025-5661".
- bf01744431 issue "1".
- bf01744431 journal "Math. Syst. Theory".
- bf01744431 journal "Math. Systems Theory".
- bf01744431 journal "Mathematical Systems Theory".
- bf01744431 journal "Mathematical systems theory".
- bf01744431 last "Furst".
- bf01744431 last1 "Furst".
- bf01744431 last2 "Saxe".
- bf01744431 last3 "Sipser".
- bf01744431 number "1".
- bf01744431 pages "13–27".
- bf01744431 title "Parity, circuits, and the polynomial-time hierarchy".
- bf01744431 url "http://link.springer.com/article/10.1007/BF01744431".
- bf01744431 volume "17".
- bf01744431 year "1984".
- bf01744431 zbl "0534.94008".