Sciweavers

25 search results - page 4 / 5
» The Boolean Formula Value Problem Is in ALOGTIME
Sort
View
DNA
2004
Springer
14 years 8 days ago
DNA-Based Computation Times
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar...
AAAI
2007
13 years 9 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ENTCS
2007
199views more  ENTCS 2007»
13 years 6 months ago
Heuristics for Safety and Security Constraints
The flow logic approach to static analysis amounts to specifying the admissibility of solutions to analysis problems; when specified using formulae in stratified alternation-fr...
Flemming Nielson, Hanne Riis Nielson
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
14 years 1 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...