Publications

Found 23 results
Author Keyword Title Type [ Year(Asc)]
Filters: Author is György Turán  [Clear All Filters]
2017
Stellan O, H SRobert, Turán G, Aaron U.  2017.  Measuring an artificial intelligence system’s performance on a Verbal IQ test for young children. Journal Of Experimental & Theoretical Artificial Intelligence 29. :679-693.
2015
Turán G, J Y.  2015.  Characterizability in belief revision. 24th International Joint Conference on Artificial Intelligence. :3236-3242.
Michael L., Kakas A., Miller R., Turán G.  2015.  Cognitive programming. 3rd International Workshop on Artificial Intelligence and Cognition. :3-18.
1998
Sloan RH, Takata K, Turán G.  1998.  On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.
Tsapara I, Turán G.  1998.  Learning Atomic Formulas with Prescribed Properties. COLT. :166–174.
1996
Horváth T, Sloan RH, Turán G.  1996.  Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop. 1314:315–336.
Turán G, Vatan F.  1996.  A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett.. 59:251–254.
1995
Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
1993
Gröger HDietmar, Turán G.  1993.  A Liniear lower bound for the size of threshold circuits. Bulletin of the EATCS. 50:220–221.
Turán G.  1993.  Lower Bounds for PAC Learning with Queries. COLT. :384–391.
Hajnal A, Maass W, Pudlák P, Szegedy M, Turán G.  1993.  Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci.. 46:129–154.
Maass W, Schnitger G, Szemerédi E, Turán G.  1993.  Two Tapes Versus One for Off-Line Turing Machines. Computational Complexity. 3:392–401.
1992
Faigle U, Schrader R, Turán G.  1992.  The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
Maass W, Turán G.  1992.  Lower Bound Methods and Separation Results for On-Line Learning Models. Machine Learning. 9:107–145.