Search Sciweavers | Sciweavers

1199 search results - page 51 / 240

» Parameterized Proof Complexity

click to vote

CADE
2005
Springer

143views Logical Reasoning» more CADE 2005»

Reflecting Proofs in First-Order Logic with Equality

14 years 9 months ago

Download www.lri.fr

Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...

Evelyne Contejean, Pierre Corbineau

claim paper

Read More »

click to vote

STOC
2010
ACM

224views Algorithms» more STOC 2010»

Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses

14 years 24 days ago

Download pages.cs.wisc.edu

Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...

Holger Dell and Dieter van Melkebeek

claim paper

Read More »

click to vote

TCC
2010
Springer

179views Cryptology» more TCC 2010»

Private Coins versus Public Coins in Zero-Knowledge Proof Systems

14 years 5 months ago

Download www.cs.cornell.edu

Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...

Rafael Pass, Muthuramakrishnan Venkitasubramaniam

claim paper

Read More »

click to vote

CORR
2010
Springer

139views Education» more CORR 2010»

A proof Procedure for Testing Membership in Regular Expressions

13 years 8 months ago

Download www.ijcim.th.org

We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...

Keehang Kwon, Hong Pyo Ha, Jiseung Kim

claim paper

Read More »

click to vote

FUIN
2008

108views more FUIN 2008»

A Simple Proof of Miller-Yu Theorem

13 years 8 months ago