182 search results - page 20 / 37 » The Proof Complexity of Polynomial Identities |
105
click to vote
IS
2010
15 years 9 days ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
159
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
106
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
130
click to vote
JACM
2010
15 years 9 days ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
110
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...