4850 search results - page 179 / 970 » Proof and Computation in Geometry |
165
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
174
click to vote
ISORC
2005
IEEE
16 years 2 days ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
163
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
170
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
171
click to vote
LICS
2005
IEEE
16 years 2 days ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...