1199 search results - page 116 / 240 » Parameterized Proof Complexity |
109
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
CIARP
2008
Springer
15 years 5 months ago
2008
Springer
This report1 considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by l...
128
click to vote
CIE
2008
Springer
15 years 5 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
138
click to vote
RSA
2000
15 years 2 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
CAS
1999
15 years 2 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...