Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
.. International Conference on Fuzzy Theory and Its Applications
| .. International Conference on Fuzzy Theory and Its Applications |
| Pubbl/distr/stampa | Piscataway, NJ : , : IEEE |
| Disciplina | 511.3 |
| Soggetto topico |
Fuzzy sets
Fuzzy systems Intelligent control systems Fuzzy logic |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISSN | 2377-5831 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
iFUZZY ..
Procceedings of ... International Conference on Fuzzy Theory and Iits Applications Conference digest Fuzzy Theory and it's Applications (iFUZZY) ... International Conference on |
| Record Nr. | UNINA-9910626179103321 |
| Piscataway, NJ : , : IEEE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
.. International Conference on Fuzzy Theory and Its Applications
| .. International Conference on Fuzzy Theory and Its Applications |
| Pubbl/distr/stampa | Piscataway, NJ : , : IEEE |
| Disciplina | 511.3 |
| Soggetto topico |
Fuzzy sets
Fuzzy systems Intelligent control systems Fuzzy logic |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISSN | 2377-5831 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
iFUZZY ..
Procceedings of ... International Conference on Fuzzy Theory and Iits Applications Conference digest Fuzzy Theory and it's Applications (iFUZZY) ... International Conference on |
| Record Nr. | UNISA-996281012203316 |
| Piscataway, NJ : , : IEEE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
1 : pt. A. XXXIV, 467 p.pt. B. 466 p.
| 1 : pt. A. XXXIV, 467 p.pt. B. 466 p. |
| Autore | Edwards, Robert E. |
| Pubbl/distr/stampa | New York : Springer-Verlag, 1979 |
| Descrizione fisica | 1 v. in 2 (p. 933 compless.) ; 23 cm |
| Disciplina | 511.3 |
| ISBN | 0-387-90431-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNINA-990000868480403321 |
Edwards, Robert E.
|
||
| New York : Springer-Verlag, 1979 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
1 Fachtagung uber automatentheorie und formale sprachen : Bonn, 9-12 Juli 1973 / herausgegeben im Auftrag der GI von Karl Heinz Bohling und Klaus Indermark
| 1 Fachtagung uber automatentheorie und formale sprachen : Bonn, 9-12 Juli 1973 / herausgegeben im Auftrag der GI von Karl Heinz Bohling und Klaus Indermark |
| Autore | Fachtagung uber automatentheorie und formale sprachen <1; Bonn; 1973> |
| Pubbl/distr/stampa | Berlin : Springer Verlag, 1973 |
| Descrizione fisica | VII, 322 p. : ill. ; 24 cm |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Record Nr. | UNISA-990000348960203316 |
|
Fachtagung uber automatentheorie und formale sprachen <1; Bonn; 1973>
|
||
| Berlin : Springer Verlag, 1973 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
10. International conference on automated deduction : Kaiserslautern, FRG, july 24-27, 1990 : proceedings / M.E. Stickel
| 10. International conference on automated deduction : Kaiserslautern, FRG, july 24-27, 1990 : proceedings / M.E. Stickel |
| Autore | International conference on automated deduction <10. ; 1990 ; Kaiserslautern> |
| Pubbl/distr/stampa | Berlin : Springer-Verlag, c1990 |
| Descrizione fisica | XVI, 688 p : ill. ; 24 cm |
| Disciplina | 511.3 |
| Collana | Lectures notes in artificial intelligence |
| Soggetto topico | Logica simbolica -- Congressi -- 1990 |
| ISBN | 3-540-52885-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000720860203316 |
|
International conference on automated deduction <10. ; 1990 ; Kaiserslautern>
|
||
| Berlin : Springer-Verlag, c1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
16th IEEE Annual Conference on Computational Complexity (CCC 2001)
| 16th IEEE Annual Conference on Computational Complexity (CCC 2001) |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2001 |
| Descrizione fisica | 1 online resource |
| Disciplina | 511.3 |
| Soggetto topico |
Computational complexity
Computational complexity - Data processing |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910872874503321 |
| [Place of publication not identified], : IEEE Computer Society Press, 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
17th IEEE Annual Conference on Computational Complexity (CCC 2002)
| 17th IEEE Annual Conference on Computational Complexity (CCC 2002) |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2002 |
| Descrizione fisica | 1 online resource (xii, 205 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational Complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Committees -- Ron Book Prize for Best Student Paper -- 2002 Best Paper Award -- Resolution Lower Bounds for the Weak Pigeonhole Principle -- Hard examples for bounded depth frege -- Resolution lower bounds for the weak pigeon hole principle -- Hard examples for bounded depth Frege -- Improved cryptographic hash functions with worst-case/average-case connection -- Algorithmic derandomization via complexity theory -- Pseudo-random generators for all hardnesses -- Randomness conductors and constant-degree lossless expanders -- Expanders from symmetric codes -- The complexity of approximating the entropy -- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems -- On communication over an entanglement-assisted quantum channel -- Hardness amplification within NP -- 3-MANIFOLD KNOT GENUS is NP-complete -- On the power of unique 2-prover 1-round games -- Learnability beyond AC/sup 0/ -- Resolution lower bounds for perfect matching principles -- Resolution width-size trade-offs for the Pigeon-Hole Principle -- The inapproximability of lattice and coding problems with preprocessing -- Sampling short lattice vectors and the closest lattice vector problem -- The history of complexity -- The correlation between parity and quadratic polynomials mod 3 -- Functions that have read-twice constant width branching programs are not necessarily testable -- On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism -- Information theory methods in communication complexity -- Extracting quantum entanglement (general entanglement purification protocols) -- Algebras of minimal rank over perfect fields -- Rapid mixing -- Pseudorandomness and average-case complexity via uniform reductions -- Pseudo-random generators and structure of complete degrees -- Decoding concatenated codes using soft information -- Arthur and Merlin in a quantum world -- Streaming computation of combinatorial objects -- Lower bounds for linear locally decodable codes and private information retrieval -- Better lower bounds for locally decodable codes -- Universal arguments and their applications -- Author index. |
| Record Nr. | UNISA-996200685103316 |
| [Place of publication not identified], : IEEE Computer Society Press, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
17th IEEE Annual Conference on Computational Complexity (CCC 2002)
| 17th IEEE Annual Conference on Computational Complexity (CCC 2002) |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2002 |
| Descrizione fisica | 1 online resource (xii, 205 pages) : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Committees -- Ron Book Prize for Best Student Paper -- 2002 Best Paper Award -- Resolution Lower Bounds for the Weak Pigeonhole Principle -- Hard examples for bounded depth frege -- Resolution lower bounds for the weak pigeon hole principle -- Hard examples for bounded depth Frege -- Improved cryptographic hash functions with worst-case/average-case connection -- Algorithmic derandomization via complexity theory -- Pseudo-random generators for all hardnesses -- Randomness conductors and constant-degree lossless expanders -- Expanders from symmetric codes -- The complexity of approximating the entropy -- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems -- On communication over an entanglement-assisted quantum channel -- Hardness amplification within NP -- 3-MANIFOLD KNOT GENUS is NP-complete -- On the power of unique 2-prover 1-round games -- Learnability beyond AC/sup 0/ -- Resolution lower bounds for perfect matching principles -- Resolution width-size trade-offs for the Pigeon-Hole Principle -- The inapproximability of lattice and coding problems with preprocessing -- Sampling short lattice vectors and the closest lattice vector problem -- The history of complexity -- The correlation between parity and quadratic polynomials mod 3 -- Functions that have read-twice constant width branching programs are not necessarily testable -- On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism -- Information theory methods in communication complexity -- Extracting quantum entanglement (general entanglement purification protocols) -- Algebras of minimal rank over perfect fields -- Rapid mixing -- Pseudorandomness and average-case complexity via uniform reductions -- Pseudo-random generators and structure of complete degrees -- Decoding concatenated codes using soft information -- Arthur and Merlin in a quantum world -- Streaming computation of combinatorial objects -- Lower bounds for linear locally decodable codes and private information retrieval -- Better lower bounds for locally decodable codes -- Universal arguments and their applications -- Author index. |
| Record Nr. | UNINA-9910872712803321 |
| [Place of publication not identified], : IEEE Computer Society Press, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
1855-2016 - IEEE Standard for Fuzzy Markup Language / / Institute of Electrical and Electronics Engineers
| 1855-2016 - IEEE Standard for Fuzzy Markup Language / / Institute of Electrical and Electronics Engineers |
| Pubbl/distr/stampa | [Place of publication not identified] : , : IEEE, , 2016 |
| Descrizione fisica | 1 online resource (97 pages) |
| Disciplina | 511.3 |
| Soggetto topico | Fuzzy logic |
| ISBN | 1-5044-0677-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910440104003321 |
| [Place of publication not identified] : , : IEEE, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
18th IEEE Annual Conference on Computational Complexity
| 18th IEEE Annual Conference on Computational Complexity |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2003 |
| Descrizione fisica | 1 online resource (402 pages) |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910872930103321 |
| [Place of publication not identified], : IEEE Computer Society Press, 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
