Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Boolean expression
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Quantum computation is becoming an important and effective tool to overcome the high real-time computational requirements of… Expand
Highly Cited
2009
Highly Cited
2009
This work presents a new framework for Grobner-basis computations with Boolean polynomials. Boolean polynomials can be modelled… Expand
Highly Cited
1994
Highly Cited
1994
Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its… Expand
Highly Cited
1991
Highly Cited
1991
Abstract : Programming computers is a notoriously error-prone process. It is the job of the programming language designer to make… Expand
Highly Cited
1986
Highly Cited
1986
1 Introduction 1.1 Language Processors 1.2 The Structure of a Compiler 1.3 The Evolution of Programming Languages 1.4 The Science… Expand
Highly Cited
1985
Highly Cited
1985
Abstract It is by now well recognized that a major impediment to developing knowledge-based systems is the knowledge-acquisition… Expand
Highly Cited
1984
Highly Cited
1984
3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears… Expand
Highly Cited
1983
Highly Cited
1983
In conventional information retrieval Boolean combinations of index terms are used to formulate the users'' information requests… Expand
Highly Cited
1956
Highly Cited
1956
A systematic procedure is presented for writing a Boolean function as a minimum sum of products. This procedure is a… Expand
Highly Cited
1954
Highly Cited
1954
A solution is sought to the general problem of simplifying switching circuits that have more than one output. The mathematical… Expand