3663 search results - page 433 / 733 » Problems in the ontology of computer programs |
163
click to vote
ECCC
2002
15 years 6 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
178
Voted
IPL
2000
15 years 6 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
193
click to vote
MSCS
2000
15 years 6 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
159
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
275
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...