Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-12
|
Results: 12
L-PRINTABLE SETS
Authors:
FORTNOW L GOLDSMITH J LEVY MA MAHANEY S
Citation:
L. Fortnow et al., L-PRINTABLE SETS, SIAM journal on computing (Print), 28(1), 1999, pp. 137-151
ON THE RELATIVE SIZES OF LEARNABLE SETS
Authors:
FORTNOW L FREIVALDS R GASARCH WI KUMMER M KURTZ SA SMITH CH STEPHAN F
Citation:
L. Fortnow et al., ON THE RELATIVE SIZES OF LEARNABLE SETS, Theoretical computer science, 197(1-2), 1998, pp. 139-156
GAP-DEFINABILITY AS A CLOSURE PROPERTY
Authors:
FENNER S FORTNOW L LI LD
Citation:
S. Fenner et al., GAP-DEFINABILITY AS A CLOSURE PROPERTY, Information and computation, 130(1), 1996, pp. 1-17
PP IS CLOSED UNDER TRUTH-TABLE REDUCTIONS
Authors:
FORTNOW L REINGOLD N
Citation:
L. Fortnow et N. Reingold, PP IS CLOSED UNDER TRUTH-TABLE REDUCTIONS, Information and computation, 124(1), 1996, pp. 1-6
ON RESOURCE-BOUNDED INSTANCE COMPLEXITY
Authors:
FORTNOW L KUMMER M
Citation:
L. Fortnow et M. Kummer, ON RESOURCE-BOUNDED INSTANCE COMPLEXITY, Theoretical computer science, 161(1-2), 1996, pp. 123-140
THE ISOMORPHISM CONJECTURE HOLDS RELATIVE TO AN ORACLE
Authors:
FENNER S FORTNOW L KURTZ SA
Citation:
S. Fenner et al., THE ISOMORPHISM CONJECTURE HOLDS RELATIVE TO AN ORACLE, SIAM journal on computing, 25(1), 1996, pp. 193-206
GENERIC SEPARATIONS
Authors:
FORTNOW L
Citation:
L. Fortnow, GENERIC SEPARATIONS, Journal of computer and system sciences, 52(1), 1996, pp. 191-197
CIRCUIT LOWER BOUNDS A LA KOLMOGOROV
Authors:
FORTNOW L LAPLANTE S
Citation:
L. Fortnow et S. Laplante, CIRCUIT LOWER BOUNDS A LA KOLMOGOROV, Information and computation, 123(1), 1995, pp. 121-126
ON THE POWER OF MULTI-PROVER INTERACTIVE PROTOCOLS
Authors:
FORTNOW L ROMPEL J SIPSER M
Citation:
L. Fortnow et al., ON THE POWER OF MULTI-PROVER INTERACTIVE PROTOCOLS, Theoretical computer science, 134(2), 1994, pp. 545-557
EXTREMES IN THE DEGREES OF INFERABILITY
Authors:
FORTNOW L GASARCH W JAIN S KINBER E KUMMER M KURTZ S PLESZKOVICH M SLAMAN T SOLOVAY R STEPHAN F
Citation:
L. Fortnow et al., EXTREMES IN THE DEGREES OF INFERABILITY, Annals of pure and applied Logic, 66(3), 1994, pp. 231-276
INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY
Authors:
FORTNOW L LUND C
Citation:
L. Fortnow et C. Lund, INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY, Theoretical computer science, 113(1), 1993, pp. 55-73
RANDOM-SELF-REDUCIBILITY OF COMPLETE-SETS
Authors:
FEIGENBAUM J FORTNOW L
Citation:
J. Feigenbaum et L. Fortnow, RANDOM-SELF-REDUCIBILITY OF COMPLETE-SETS, SIAM journal on computing, 22(5), 1993, pp. 994-1005
Risultati:
1-12
|