725 search results - page 41 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
100
Voted
SAT
2010
Springer
15 years 6 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
119
Voted
JACM
2002
15 years 2 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
217
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
109
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
139
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...