On Datalog vs. polynomial time (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Characterizing non-deterministic circuit size
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Size-depth trade-offs for threshold circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Journal of the ACM (JACM)
Exponential lower bounds for depth 3 Boolean circuits
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Hardness Results for Learning First-Order Representations and Programming by Demonstration
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Higher lower bounds on monotone size
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Relational queries over interpreted structures
Journal of the ACM (JACM)
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
Circuit and decision tree complexity of some number theoretic problems
Information and Computation
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
Complex Probabilistic Modeling with Recursive Relational Bayesian Networks
Annals of Mathematics and Artificial Intelligence
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Theoretical Computer Science
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Counting and Locality over Finite Structures: A Survey
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Preprocessing of intractable problems
Information and Computation
Information and Computation - Special issue: LICS'97
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
On learning monotone DNF under product distributions
Information and Computation
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Analog versus discrete neural networks
Neural Computation
Some Theorems Concerning the Core Function
Concurrency, Graphs and Models
Smallest Formulas for Parity of 2k Variables Are Essentially Unique
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Theoretical Computer Science
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
On the expressiveness of Levesque's normal form
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
The DL-lite family and relations
Journal of Artificial Intelligence Research
Circuit complexity of testing square-free numbers
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding a duplicate and a missing item in a stream
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
Forming concepts for fast inference
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Algorithms and theory of computation handbook
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Negation-Limited complexity of parity and inverters
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
The GCT program toward the P vs. NP problem
Communications of the ACM
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.02 |