Found 6 results[ Author] Keyword Title Type Year
Filters: Author is György Turán [Clear All Filters]
Lower Bounds for PAC Learning with Queries. COLT. :384–391.. 1993.
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 (Extended Abstract). FOCS. :553–564.. 1994.
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett.. 59:251–254.. 1996.
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.. 1997.
Characterizability in belief revision. 24th International Joint Conference on Artificial Intelligence. :3236-3242.. 2015.