1226 search results - page 32 / 246 » Proofs, Programs and Abstract Complexity |
133
click to vote
CIE
2010
Springer
15 years 6 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
117
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
100
click to vote
ADG
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
118
click to vote
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
129
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...