Found 23 results
Author Keyword [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is T and Author is György Turán  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
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.
Faigle U, Schrader R, Turán G.  1992.  The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
Turán G, Vatan F.  1997.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.
Turán G, Vatan F.  1994.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS. :553–564.
Sloan RH, Takata K, Turán G.  1998.  On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.
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.