José Balcázar, Harry Buhrman, Montserrat Hermo  Home/Search
Context
Related
| lsi.upc.es/~balqui/postscr...klow.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsi.upc.es/~balqui/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study circuit expressions of logarithmic and poly-logarithmic polynomial-time Kolmogorov complexity, focusing on their complexity-theoretic characterizations and learnability properties. They provide a nontrivial circuit-like characterization for a natural nonuniform complexity class that lacked it up to now. We show that circuit expressions of this kind can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Thus they are learnable given... (Update)
Similar documents (at the sentence level):
7.9%: Characterizing the Learnability of Kolmogorov Easy Circuit.. - Jos'e Balc'azar (Correct)
Active bibliography (related documents): More All
1.4: The Structure of Logarithmic Advice Complexity Classes - José.. (1997) (Correct)
0.6: Coding Complexity: The Computational Complexity of .. - Balcázar.. (1996) (Correct)
0.6: Refining Logical Characterizations of Advice Complexity.. - Atserias, Balcázar (1997) (Correct)
Similar documents based on text: More All
0.5: Negative Results on Learning Dependencies - With Queries Montserrat (Correct)
0.4: Learnability of Kolmogorov-Easy Circuit Expressions Via.. - Balcázar.. (Correct)
0.4: Structure and Complexity - Allender, Schöning, Wagner (1996) (Correct)
BibTeX entry: (Update)
@misc{ zar-circuit,
author = "José Balcázar and Harry Buhrman and Montserrat Hermo",
title = "Circuit Expressions of Low Kolmogorov Complexity",
url = "citeseer.ist.psu.edu/65901.html" }
Citations (may not include all citations):534 The Complexity of Theorem-proving Procedures (context) - Cook - 1971
441 Queries and Concept Learning (context) - Angluin - 1988
128 A Complexity-Theoretic Approach to Randomness (context) - Sipser - 1983
64 Universal Sequential Search Problems (context) - Levin - 1973
49 Generalized Kolmogorov Complexity and the Structure of Feasi.. (context) - Hartmanis - 1983
42 Learning Simple Concepts under Simple Distributions - Li, Vit'anyi - 1991
36 With What Frequency are Apparently Intractable Problems Diff.. (context) - Meyer, Paterson - 1979
33 Reductions to Sets of Low Information Content - Arvind, Han et al. - 1993
31 Lower Bounds for the Low Hierarchy - Allender, Hemachandra - 1992
27 On Helping by Robust Oracle Machines (context) - Ko - 1987
25 Optimal Algorithms for Self-reducible Problems (context) - Schnorr - 1976
23 Resource bounded Kolmogorov complexity revisited - Buhrman, Fortnow - 1997
22 Theoretical Computer Science (context) - Balc'azar, Schoning et al. - 1992
22 Decision versus Search Problems in Super-Polynomial Time (context) - Impagliazzo, Tardos - 1989
19 Kolmogorov Complexity and Degrees of Tally Sets (context) - Allender, Watanabe - 1990
19 A Survey of Russian Approaches to Perebor (context) - Trakhtenbrot - 1984
19 SIAM Journal on Computing (context) - Balc'azar, Book et al. - 1986
14 Upper Bounds on the Complexity of Sparse and Tally Descripti.. - Arvind, Kobler et al. - 1996
14 A Framework for Polynomial Time Query Learnability (context) - Watanabe - 1994
14 Structural Analysis of Polynomial-Time Query Learnability (context) - Watanabe, Gavalda - 1994
11 On Some Natural Complete Operators (context) - Ko - 1985
10 Computational Work and Time of Finite Machines (context) - Savage - 1972
9 Characterizations of Logarithmic Advice Complexity Classes (context) - Balc'azar, Hermo et al. - 1992
6 A Note on Polynomial Size Circuits with Low ResourceBounded .. - Hermo, Mayordomo - 1994
6 Nonuniform Complexity Classes with Sub-Linear Advice Functio.. (context) - Hermo - 1996
5 The Structure of Logarithmic Advice Complexity Classes (context) - Balc'azar, Hermo - 1998
3 Mathematical Systems Theory (context) - Long, Sheu et al. - 1995
2 Complexity Classes Between \Theta P k and \Delta P k (context) - Castro, Seara - 1996
1 Coding Complexity: The Computational Complexity of Succint D.. (context) - Balc'azar, Gavalda et al. - 1997
Documents on the same site (http://www-lsi.upc.es/~balqui/papers.html): More
Simple PAC learning of simple decision lists - Castro, Balcázar (1995) (Correct)
Refining Logical Characterizations of Advice Complexity.. - Atserias, Balcázar (1997) (Correct)
A First-Order Isomorphism Theorem - Allender, Balcázar, Immerman (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC