4850 search results - page 382 / 970 » Proof and Computation in Geometry |
123
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
137
click to vote
JSC
2006
15 years 6 months ago
2006
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
204
click to vote
ENTCS
2002
15 years 6 months ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
146
click to vote
INFORMATICALT
2010
15 years 5 months ago
2010
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
197
click to vote
MST
2010
15 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...