Logic circuit design with the aid of an automated reasoning program
ACM SIGDA Newsletter
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Functions with bounded symmetric communication complexity and circuits with mod m gates
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Depth-Size Tradeoffs for Neural Computation
IEEE Transactions on Computers - Special issue on artificial neural networks
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
IEEE Transactions on Computers
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh 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
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Expressive Power of OKFDDs
Formal Methods in System Design
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A new general derandomization method
Journal of the ACM (JACM)
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On theory revision with queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Pseudo-Kronecker Expressions for Symmetric Functions
IEEE Transactions on Computers
Two Operand Binary Adders with Threshold Logic
IEEE Transactions on Computers
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing a context-free grammar-generating series
Information and Computation
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
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
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Covering Sequences of Boolean Functions and Their Cryptographic Significance
Designs, Codes and Cryptography
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Limits of Using Signatures for Permutation Independent Boolean Comparison
Formal Methods in System Design
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Approximation quality for sorting rules
Computational Statistics & Data Analysis
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
Integration, the VLSI Journal
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Monotone simulations of non-monotone proofs
Journal of Computer and System Sciences - Complexity 2001
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
On the Complexity and Inapproximability of Shortest Implicant Problems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Space Time Tradeoffs for Graph Properties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximations by OBDDs and the Variable Ordering Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Discretization Problem for Rough Sets Methods
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Some Remarks on Extensions and Restrictions of Information Systems
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
A New Method for Determining of Extensions and Restrictions of Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Coverage Metrics for Temporal Logic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Private Computation - k-Connected versus 1-Connected Networks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Some Afterthoughts on Hopfield Networks
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
CDR: A Rewriting Based Tool to Design FPLA Circuits
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Mathematical models of quantum computation
New Generation Computing
A Note on the Bottleneck Counting Argument
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Journal of Mathematical Psychology
From type inference to configuration
The essence of computation
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
Synthesis of Petri net models: a rough set approach
Fundamenta Informaticae - Concurrency specification and programming
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Computer algebra handbook
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics
The complexity of tensor calculus
Computational Complexity
Complexity and Probability of Some Boolean Formulas
Combinatorics, Probability and Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
Neural Computation
On the Computational Power of Winner-Take-All
Neural Computation
Theoretical Computer Science
Coverage metrics for temporal logic model checking
Formal Methods in System Design
Bayesian network modelling through qualitative patterns
Artificial Intelligence
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Theoretical Computer Science
Delay optimization of linear depth boolean circuits with prescribed input arrival times
Journal of Discrete Algorithms
Binary Decision Diagrams and neural networks
The Journal of Supercomputing
The delay of circuits whose inputs have specified arrival times
Discrete Applied Mathematics
Predicting carcinoid heart disease with the noisy-threshold classifier
Artificial Intelligence in Medicine
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
The optimal read-once branching program complexity for the direct storage access function
Information Processing Letters
The decomposition tree for analyses of boolean functions
Mathematical Structures in Computer Science
Analog versus discrete neural networks
Neural Computation
The computational power of discrete hopfield nets with hidden units
Neural Computation
Boolean function complexity and neural networks
NN'06 Proceedings of the 7th WSEAS International Conference on Neural Networks
Learning symmetric causal independence models
Machine Learning
On the resolution and optimization of a system of fuzzy relational equations with sup-T composition
Fuzzy Optimization and Decision Making
Models and quantifier elimination for quantified Horn formulas
Discrete Applied Mathematics
Linear Transformations in Boolean Complexity Theory
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Smallest Formulas for Parity of 2k Variables Are Essentially Unique
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the Complexity of Obtaining Optimal Watermarking Schemes
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Evolutionary Computation
Investigation of the global dynamics of cellular automata using Boolean derivatives
Computers & Mathematics with Applications
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
Modelling treatment effects in a clinical Bayesian network using Boolean threshold functions
Artificial Intelligence in Medicine
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Note: Limiting negations in non-deterministic circuits
Theoretical Computer Science
On the Readability of Monotone Boolean Formulae
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Feebly Secure Trapdoor Function
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Journal of Artificial Intelligence Research
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Bayesian network modelling through qualitative patterns
Artificial Intelligence
IEEE Transactions on Neural Networks
Learning Deep Architectures for AI
Foundations and Trends® in Machine Learning
Hilbert's Thirteenth Problem and Circuit Complexity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
General Pseudo-random Generators from Weaker Models of Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters
IEEE Transactions on Neural Networks
Exploiting causal independence in large Bayesian networks
Knowledge-Based Systems
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Theoretical Computer Science
Modularity in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Circuit complexity of testing square-free numbers
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Relating branching program size and formula size over the full binary basis
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Constructive threshold logic addition: a synopsis of the last decade
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Playing monotone games to understand learning behaviors
Theoretical Computer Science
Exact OBDD bounds for some fundamental functions
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
A well-mixed function with circuit complexity 5n ± o(n): tightness of the Lachish-Raz-type bounds
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A logic-based representation for coalitional games with externalities
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Transactions on rough sets XII
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
The complexity of word circuits
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The size and depth of layered Boolean circuits
Information Processing Letters
High Accuracy Asymptotic Bounds on the BDD Size and Weight of the Hardest Functions
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Theoretical Computer Science
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds
Theoretical Computer Science
Efficient automatic resolution of encoding conflicts using STG unfoldings
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Estimating Jones polynomials is a complete problem for one clean qubit
Quantum Information & Computation
Gate elimination for linear functions and new feebly secure constructions
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Holographic computation of balanced succinct permanent instances
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the readability of monotone Boolean formulae
Journal of Combinatorial Optimization
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
EM algorithm for symmetric causal independence models
ECML'06 Proceedings of the 17th European conference on Machine Learning
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Approximability of minimum AND-Circuits
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On the BDD of a random boolean function
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
On the algebraic immunity of symmetric boolean functions
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Neural network architecture selection: size depends on function complexity
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part I
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the complexity of min-max sorting networks
Information Sciences: an International Journal
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A qualitative characterisation of causal independence models using boolean polynomials
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Improving the therapeutic performance of a medical bayesian network using noisy threshold models
ISBMDA'05 Proceedings of the 6th International conference on Biological and Medical Data Analysis
On the monotone circuit complexity of quadratic boolean functions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Role of function complexity and network size in the generalization ability of feedforward networks
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Monotone multilinear boolean circuits for bipartite perfect matching require exponential size
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On the expressive power of FO[+]
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Time complexity of decision trees
Transactions on Rough Sets III
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
On the nonnegative rank of distance matrices
Information Processing Letters
Cryptographic analysis of all 4 × 4-bit s-boxes
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Discrete Applied Mathematics
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
Synthesis of Petri Net Models: A Rough Set Approach
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
An Application of Rough Set Methods in Control Design
Fundamenta Informaticae
On Average Time Complexity of Decision Trees and Branching Programs
Fundamenta Informaticae
The More We Learn the Less We Know?: On Inductive Learning from Examples
Fundamenta Informaticae
From Optimal Hyperplanes to Optimal Decision Trees
Fundamenta Informaticae
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach
Fundamenta Informaticae
Rough set analysis of relational structures
Information Sciences: an International Journal
Sa based power efficient FPGA LUT mapping
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Computing datalog rewritings beyond horn ontologies
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Dynamic policy adaptation for inference control of queries to a propositional information system
Journal of Computer Security - DBSec 2011
The Complexity of Szilard Languages of Matrix Grammars Revisited
Fundamenta Informaticae
| Hi-index | 0.02 |