팔로우
Gyorgy Turan
Gyorgy Turan
University of Illinois at Chicago, and Hungarian Academy of Sciences
uic.edu의 이메일 확인됨
제목
인용
인용
연도
Threshold circuits of bounded depth
A Hajnal, W Maass, P Pudlák, M Szegedy, G Turán
Journal of Computer and System Sciences 46 (2), 129-154, 1993
5091993
On the complexity of cutting-plane proofs
W Cook, CR Coullard, G Turán
Discrete Applied Mathematics 18 (1), 25-38, 1987
3471987
On the succinct representation of graphs
G Turán
Discrete Applied Mathematics 8 (3), 289-294, 1984
2621984
On the performance of on-line algorithms for partition problems
U Faigle, W Kern, G Turán
Acta cybernetica 9 (2), 107-119, 1989
2391989
Resolution proofs of generalized pigeonhole principles
SR Buss, G Turan
Theoretical Computer Science 62 (3), 311-317, 1988
1251988
How fast can a threshold gate learn?
W Maass, G Turán
Proceedings of a workshop on Computational learning theory and natural …, 1994
1141994
Lower bound methods and separation results for on-line learning models
W Maass, G Turán
Machine Learning 9, 107-145, 1992
1091992
On the communication complexity of graph properties
A Hajnal, W Maass, G Turán
Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988
941988
Two lower bounds for branching programs
M Ajtai, L Babai, P Hajnal, J Komlós, P Pudlák
Proceedings of the eighteenth annual ACM symposium on Theory of computing, 30-38, 1986
941986
On the complexity of learning from counterexamples
W Maass, G Turán
FOCS, 262-267, 1989
871989
Malicious omissions and errors in answers to membership queries
D Angluin, M Kriķis, RH Sloan, G Turán
Machine Learning 28, 211-255, 1997
541997
On the complexity of learning from counterexamples and membership queries
W Maass, G Turán
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
521990
Algorithms and lower bounds for on-line learning of geometrical concepts
W Maass, G Turán
Machine Learning 14, 251-269, 1994
511994
The critical complexity of graph properties
G TURIN
Inform. Process. Lm 18, 151-153, 1984
511984
Sorting and recognition problems for ordered sets
U Faigle, G Turán
SIAM Journal on Computing 17 (1), 100-113, 1988
471988
Horn Complements: Towards Horn-to-Horn Belief Revision.
M Langlois, RH Sloan, B Szörényi, G Turán
AAAI, 466-471, 2008
462008
Learning logic programs with structured background knowledge
T Horváth, G Turán
Artificial Intelligence 128 (1-2), 31-97, 2001
412001
On the definability of properties of finite graphs
G Turán
Discrete Mathematics 49 (3), 291-302, 1984
411984
Learnability and definability in trees and similar structures
M Grohe, G Turán
Theory of Computing Systems 37 (1), 193-220, 2004
402004
On the computation of Boolean functions by analog circuits of bounded fan-in
G Turán, F Vatan
journal of computer and system sciences 54 (1), 199-212, 1997
371997
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20