173 search results - page 27 / 35 » A Proof of the Two-path Conjecture |
121
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
196
click to vote
ECCC
2011
15 years 17 days ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
143
click to vote
IJCAI
2007
15 years 7 months ago
2007
Using the achievements of my research group over the last 30+ years, I provide evidence to support the following hypothesis: By complementing each other, cooperating reasoning pro...
154
click to vote
JCT
2011
15 years 16 days ago
2011
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
180
click to vote
KBSE
2000
IEEE
15 years 9 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...