Publications

Found 6 results
[ Author(Desc)] Keyword Title Type Year
Filters: 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 
T
Turán G.  1993.  Lower Bounds for PAC Learning with Queries. COLT. :384–391.
Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
Turán G, Vatan F.  1994.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS. :553–564.
Turán G, Vatan F.  1996.  A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett.. 59:251–254.
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, J Y.  2015.  Characterizability in belief revision. 24th International Joint Conference on Artificial Intelligence. :3236-3242.