Matches in DBpedia 2015-10 for { <http://www.springerlink.com/content/m64ju7clmqhqmv9g/> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- m64ju7clmqhqmv9g contribution "A superpolynomial lower bound for a circuit computing the clique function with at most log log n negation gates".
- m64ju7clmqhqmv9g first1 "K.".
- m64ju7clmqhqmv9g first2 "A.".
- m64ju7clmqhqmv9g isCitedBy Clique_problem.
- m64ju7clmqhqmv9g last1 "Amano".
- m64ju7clmqhqmv9g last2 "Maruoka".
- m64ju7clmqhqmv9g pages "399–408".
- m64ju7clmqhqmv9g publisher Springer-Verlag.
- m64ju7clmqhqmv9g series "Lecture Notes in Computer Science".
- m64ju7clmqhqmv9g title "Proc. Symp. Mathematical Foundations of Computer Science".
- m64ju7clmqhqmv9g url m64ju7clmqhqmv9g.
- m64ju7clmqhqmv9g volume "1450".
- m64ju7clmqhqmv9g year "1998".