Publications
Found 23 results
Author Keyword [ Title] Type Year Filters: Author is György Turán [Clear All Filters]
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Machine Learning. 14:251–269.
.
1994. Characterizability in belief revision. 24th International Joint Conference on Artificial Intelligence. :3236-3242.
.
2015. Cognitive programming. 3rd International Workshop on Artificial Intelligence and Cognition. :3-18.
.
2015. The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
.
1992. On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
.
1995. On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.
.
1997. .
1994. On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.
.
1998. .
1994.
Learning Atomic Formulas with Prescribed Properties. COLT. :166–174.
.
1998. Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT. 1208:38–50.
.
1997. .
1997. Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop. 1314:315–336.
.
1996. Learning logic programs with structured background knowledge. Artif. Intell.. 128:31–97.
.
2001. Learning with Queries but Incomplete Information (Extended Abstract). COLT. :237–245.
.
1994. A Liniear lower bound for the size of threshold circuits. Bulletin of the EATCS. 50:220–221.
.
1993. Lower Bound Methods and Separation Results for On-Line Learning Models. Machine Learning. 9:107–145.
.
1992. Lower Bounds for PAC Learning with Queries. COLT. :384–391.
.
1993. Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning. 28:211–255.
.
1997. Measuring an artificial intelligence system’s performance on a Verbal IQ test for young children. Journal Of Experimental & Theoretical Artificial Intelligence 29. :679-693.
.
2017. A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett.. 59:251–254.
.
1996. Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci.. 46:129–154.
.
1993. Two Tapes Versus One for Off-Line Turing Machines. Computational Complexity. 3:392–401.
.
1993.