Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase NEXP-time (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991 (1) 1997 (2) 2004 (1)
Publication types (Num. hits)
article(2) inproceedings(2)
Venues (Conferences, Journals, ...)
ACM Trans. Comput. Log.(1) FOCS(1) J. Comput. Syst. Sci.(1) LICS(1)
Authors
Adi Shamir(2) Dror Lapidot(2) Carsten Lutz(1) Kousha Etessami(1) Moshe Y. Vardi(1) Thomas Wilke(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
67Dror Lapidot, Adi Shamir Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF one-round perfect zero-knowledge protocol, fully parallelized multi prover protocols, NEXP-time, language, parallel executions
33Kousha Etessami, Moshe Y. Vardi, Thomas Wilke First-Order Logic with Two Variables and Unary Temporal Logic. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
31Carsten Lutz NEXP TIME-complete description logics with concrete domains. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF NExpTime-completeness, concrete domains, domino problem, Computational complexity, description logic, post correspondence problem
31Dror Lapidot, Adi Shamir Fully Parallelized Multi-Prover Protocols for NEXP-Time. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license