Results 1  10
of
454,149
A logic for constantdepth circuits
 Information and Control
, 1984
"... Consider a family of boolean circuits C~, C2,..., C,,..., constructed by some uniform, effective procedure operating on input n. Such a procedure provides a concise representation of a family of parallel algorithms for computing boolean values. A formula of firstorder logic may also be viewed as a ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
, constantdepth, unboundedfanin circuits constructed by Turing machines of bounded computational complexity. © 1984 Academic Press, Inc. Several papers (Chandra et al., 1983a; Chandra et al., 1982; Chandra et al., 1983b; Furst et al., 1981; Sipser, 1983) have recently dealt with the
Definability by constantdepth polynomialsize circuits
 Information and Control
, 1986
"... A function of boolean arguments is symmetric if its value depends solely on the number of l's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constantdepth polynomialsize sequences of boolean circuits, and discus ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
to circuits recognizing firstorder structures. By imposing fairly natural restrictions we develop a circuit model with precisely the power of firstorder logic: a class of structures is firstorder definable if and only if it can be recognized by a constantdepth polynomialtime sequence of such circuits
On the ConstantDepth Complexity of kClique
"... We prove a lower bound of ω(n k/4) on the size of constantdepth circuits solving the kclique problem on nvertex graphs (for every constant k). This improves a lower bound of ω(n k/89d2) due to Beame where d is the circuit depth. Our lower bound has the advantage that it does not depend on the cons ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We prove a lower bound of ω(n k/4) on the size of constantdepth circuits solving the kclique problem on nvertex graphs (for every constant k). This improves a lower bound of ω(n k/89d2) due to Beame where d is the circuit depth. Our lower bound has the advantage that it does not depend
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Lower Bounds to the Size of ConstantDepth Propositional Proofs
, 1994
"... 1 LK is a natural modification of Gentzen sequent calculus for propositional logic with connectives : and V ; W (both of unbounded arity). Then for every d 0 and n 2, there is a set T d n of depth d sequents of total size O(n 3+d ) which are refutable in LK by depth d + 1 proof of size exp ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
1 LK is a natural modification of Gentzen sequent calculus for propositional logic with connectives : and V ; W (both of unbounded arity). Then for every d 0 and n 2, there is a set T d n of depth d sequents of total size O(n 3+d ) which are refutable in LK by depth d + 1 proof of size
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
LowPower CMOS Digital Design
 JOURNAL OF SOLIDSTATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413
, 1992
"... Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use the ..."
Abstract

Cited by 570 (20 self)
 Add to MetaCart
the lowest possible supply voltage coupled with architectural, logic style, circuit, and technology optimizations. An architecturalbased scaling strategy is presented which indicates that the optimum voltage is much lower than that determined by other scaling considerations. This optimum is achieved
Results 1  10
of
454,149