793 search results - page 91 / 159 » Argumentation and standards of proof |
105
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
106
Voted
ECCC
2008
15 years 22 days ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
77
Voted
CADE
2006
Springer
16 years 29 days ago
2006
Springer
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
94
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
115
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...