Computational complexity and cryptography

Applied Filters

People

Publications

Conferences

Publication Date

7 Results for: Book/Issue: STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,790,159 records)|Limit your search to The ACM Full-Text Collection (766,444 records)

Showing 1 - 7of7 Results

Filters

Select All

Export Citations Save to Binder

per page:

Recency

Article
Free
November 1986
The complexity of reasoning about knowledge and time
- J Y Halpern,
- M Y Vardi
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 304–315https://doi.org/10.1145/12130.12161
46
646
Metrics
Total Citations46
Total Downloads646
Last 12 Months95
Last 6 weeks16
View online with eReader
PDF
Article
Free
November 1986
Four pages are necessary and sufficient for planar graphs
- M Yannakakis
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 104–108https://doi.org/10.1145/12130.12141
48
772
Metrics
Total Citations48
Total Downloads772
Last 12 Months75
Last 6 weeks9
View online with eReader
PDF
Article
Free
November 1986
The complexity of optimization problems
- M W Krentel
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 69–76https://doi.org/10.1145/12130.12138
43
2,795
Metrics
Total Citations43
Total Downloads2,795
Last 12 Months901
Last 6 weeks136
View online with eReader
PDF
Article
Free
November 1986
Private coins versus public coins in interactive proof systems
- S Goldwasser,
- M Sipser
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 59–68https://doi.org/10.1145/12130.12137
181
1,649
Metrics
Total Citations181
Total Downloads1,649
Last 12 Months210
Last 6 weeks24
View online with eReader
PDF
Article
Free
November 1986
Two lower bounds for branching programs
- M Ajtai,
- L Babai,
- P Hajnal,
- J Komlos,
- P Pudlak
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 30–38https://doi.org/10.1145/12130.12134
39
438
Metrics
Total Citations39
Total Downloads438
Last 12 Months51
Last 6 weeks9
View online with eReader
PDF
Article
Free
November 1986
Almost optimal lower bounds for small depth circuits
- J Hastad
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 6–20https://doi.org/10.1145/12130.12132
318
1,381
Metrics
Total Citations318
Total Downloads1,381
Last 12 Months190
Last 6 weeks23
View online with eReader
PDF
Article
Free
November 1986
Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹
- D A Barrington
STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingPages 1–5https://doi.org/10.1145/12130.12131
146
1,434
Metrics
Total Citations146
Total Downloads1,434
Last 12 Months170
Last 6 weeks26
View online with eReader
PDF

Applied Filters

People

Names

Institutions

Authors

Publications

Proceedings/Book Names

All Publications

Media Formats

Publisher

Conferences

Sponsors

Conference Event

Proceedings Series

Publication Date

The complexity of reasoning about knowledge and time

Four pages are necessary and sufficient for planar graphs

The complexity of optimization problems

Private coins versus public coins in interactive proof systems

Two lower bounds for branching programs

Almost optimal lower bounds for small depth circuits

Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹

Applied Filters

People

Names

Institutions

Authors

Publications

Proceedings/Book Names

All Publications

Media Formats

Publisher

Conferences

Sponsors

Conference Event

Proceedings Series

Publication Date

Save to Binder

The complexity of reasoning about knowledge and time

Four pages are necessary and sufficient for planar graphs

The complexity of optimization problems

Private coins versus public coins in interactive proof systems

Two lower bounds for branching programs

Almost optimal lower bounds for small depth circuits

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹